Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688900159.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688900159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.7K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 07:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 07:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 30 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 30 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 920K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654265224380

Running Version 202205111006
[2022-06-03 14:07:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2022-06-03 14:07:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:07:06] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-06-03 14:07:06] [INFO ] Transformed 2186 places.
[2022-06-03 14:07:06] [INFO ] Transformed 3192 transitions.
[2022-06-03 14:07:06] [INFO ] Found NUPN structural information;
[2022-06-03 14:07:06] [INFO ] Parsed PT model containing 2186 places and 3192 transitions in 335 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 41 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 119056 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119056 steps, saw 34712 distinct states, run finished after 3022 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 3158 rows 2186 cols
[2022-06-03 14:07:10] [INFO ] Computed 422 place invariants in 235 ms
[2022-06-03 14:07:11] [INFO ] [Real]Absence check using 105 positive place invariants in 55 ms returned sat
[2022-06-03 14:07:11] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 139 ms returned sat
[2022-06-03 14:07:11] [INFO ] After 1383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-03 14:07:12] [INFO ] [Nat]Absence check using 105 positive place invariants in 25 ms returned sat
[2022-06-03 14:07:12] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 94 ms returned sat
[2022-06-03 14:07:36] [INFO ] After 23468ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2022-06-03 14:07:36] [INFO ] After 23484ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-03 14:07:36] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
FORMULA ASLink-PT-10a-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 4 different solutions.
FORMULA ASLink-PT-10a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 57239 ms.
Support contains 236 out of 2186 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 38 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 2129 transition count 2994
Reduce places removed 164 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 175 rules applied. Total rules applied 396 place count 1965 transition count 2983
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 407 place count 1954 transition count 2983
Performed 186 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 186 Pre rules applied. Total rules applied 407 place count 1954 transition count 2797
Deduced a syphon composed of 186 places in 6 ms
Ensure Unique test removed 66 places
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 438 rules applied. Total rules applied 845 place count 1702 transition count 2797
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 846 place count 1702 transition count 2796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 847 place count 1701 transition count 2796
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 855 place count 1693 transition count 2758
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 864 place count 1692 transition count 2758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 869 place count 1691 transition count 2754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 871 place count 1689 transition count 2754
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 18 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 128 rules applied. Total rules applied 999 place count 1625 transition count 2690
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1000 place count 1625 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1001 place count 1624 transition count 2689
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1006 place count 1624 transition count 2684
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1011 place count 1619 transition count 2684
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1017 place count 1619 transition count 2684
Applied a total of 1017 rules in 1132 ms. Remains 1619 /2186 variables (removed 567) and now considering 2684/3158 (removed 474) transitions.
Finished structural reductions, in 1 iterations. Remains : 1619/2186 places, 2684/3158 transitions.
Interrupted random walk after 992210 steps, including 6459 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen 0
Interrupted Best-First random walk after 711656 steps, including 446 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Interrupted Best-First random walk after 740762 steps, including 534 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 0
Interrupted Best-First random walk after 825249 steps, including 583 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 705 resets, run finished after 4941 ms. (steps per millisecond=202 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 905301 steps, including 643 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen 0
Interrupted Best-First random walk after 867039 steps, including 627 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 668 resets, run finished after 4973 ms. (steps per millisecond=201 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 10128058 steps, run timeout after 192001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 10128058 steps, saw 1986748 distinct states, run finished after 192002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2684 rows 1619 cols
[2022-06-03 14:12:52] [INFO ] Computed 297 place invariants in 60 ms
[2022-06-03 14:12:52] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 14:12:53] [INFO ] [Nat]Absence check using 83 positive place invariants in 16 ms returned sat
[2022-06-03 14:12:53] [INFO ] [Nat]Absence check using 83 positive and 214 generalized place invariants in 111 ms returned sat
[2022-06-03 14:13:25] [INFO ] After 32040ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-06-03 14:13:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-03 14:13:43] [INFO ] After 18251ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :3 sat :0
[2022-06-03 14:13:43] [INFO ] After 50989ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
FORMULA ASLink-PT-10a-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8122 ms.
Support contains 195 out of 1619 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1619/1619 places, 2684/2684 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 1619 transition count 2680
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1615 transition count 2680
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 1615 transition count 2675
Deduced a syphon composed of 5 places in 5 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 1606 transition count 2675
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 1605 transition count 2674
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 1605 transition count 2673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 1604 transition count 2673
Applied a total of 26 rules in 224 ms. Remains 1604 /1619 variables (removed 15) and now considering 2673/2684 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 1604/1619 places, 2673/2684 transitions.
Incomplete random walk after 1000000 steps, including 6590 resets, run finished after 28497 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 731789 steps, including 461 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 0
Interrupted Best-First random walk after 835984 steps, including 623 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 885900 steps, including 645 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
Interrupted Best-First random walk after 892988 steps, including 668 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 0
Interrupted probabilistic random walk after 7588438 steps, run timeout after 144001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 7588438 steps, saw 1533599 distinct states, run finished after 144004 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2673 rows 1604 cols
[2022-06-03 14:17:04] [INFO ] Computed 293 place invariants in 57 ms
[2022-06-03 14:17:05] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:17:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 21 ms returned sat
[2022-06-03 14:17:05] [INFO ] [Nat]Absence check using 82 positive and 211 generalized place invariants in 70 ms returned sat
[2022-06-03 14:17:32] [INFO ] After 26497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 14:17:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-03 14:17:50] [INFO ] After 18507ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 14:17:58] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 6 ms to minimize.
[2022-06-03 14:17:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2022-06-03 14:18:05] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2022-06-03 14:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1557 ms
[2022-06-03 14:18:06] [INFO ] After 34304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16158 ms.
[2022-06-03 14:18:22] [INFO ] After 77532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27372 ms.
Support contains 195 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1604/1604 places, 2673/2673 transitions.
Applied a total of 0 rules in 55 ms. Remains 1604 /1604 variables (removed 0) and now considering 2673/2673 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1604/1604 places, 2673/2673 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1604/1604 places, 2673/2673 transitions.
Applied a total of 0 rules in 53 ms. Remains 1604 /1604 variables (removed 0) and now considering 2673/2673 (removed 0) transitions.
// Phase 1: matrix 2673 rows 1604 cols
[2022-06-03 14:18:50] [INFO ] Computed 293 place invariants in 61 ms
[2022-06-03 14:18:51] [INFO ] Implicit Places using invariants in 1214 ms returned [1, 19, 20, 22, 32, 50, 68, 143, 158, 171, 175, 213, 267, 297, 310, 311, 312, 313, 351, 433, 449, 450, 451, 452, 453, 471, 489, 578, 593, 599, 600, 618, 636, 717, 730, 731, 732, 733, 753, 771, 807, 827, 837, 862, 875, 876, 877, 898, 916, 1014, 1015, 1016, 1017, 1018, 1036, 1054, 1107, 1119, 1139, 1154, 1155, 1156, 1157, 1158, 1176, 1194, 1275, 1288, 1289, 1290, 1291, 1292, 1310, 1328, 1391, 1399, 1418, 1429, 1432, 1433, 1434, 1469, 1471, 1493, 1494, 1495, 1508, 1514, 1520, 1526, 1532, 1538, 1544, 1550, 1556, 1562]
Discarding 96 places :
Implicit Place search using SMT only with invariants took 1228 ms to find 96 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1508/1604 places, 2673/2673 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 1508 transition count 2601
Reduce places removed 72 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 98 rules applied. Total rules applied 170 place count 1436 transition count 2575
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 196 place count 1410 transition count 2575
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 196 place count 1410 transition count 2523
Deduced a syphon composed of 52 places in 4 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 300 place count 1358 transition count 2523
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 22 rules applied. Total rules applied 322 place count 1347 transition count 2512
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 333 place count 1336 transition count 2512
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 348 place count 1321 transition count 2497
Iterating global reduction 5 with 15 rules applied. Total rules applied 363 place count 1321 transition count 2497
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 366 place count 1321 transition count 2494
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 375 place count 1312 transition count 2485
Iterating global reduction 6 with 9 rules applied. Total rules applied 384 place count 1312 transition count 2485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 386 place count 1312 transition count 2483
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 516 place count 1247 transition count 2418
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 519 place count 1244 transition count 2415
Iterating global reduction 7 with 3 rules applied. Total rules applied 522 place count 1244 transition count 2415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 523 place count 1244 transition count 2414
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 525 place count 1244 transition count 2412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 527 place count 1242 transition count 2412
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 9 with 33 rules applied. Total rules applied 560 place count 1242 transition count 2379
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 593 place count 1209 transition count 2379
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 594 place count 1208 transition count 2378
Iterating global reduction 10 with 1 rules applied. Total rules applied 595 place count 1208 transition count 2378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 596 place count 1208 transition count 2377
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 11 with 28 rules applied. Total rules applied 624 place count 1208 transition count 2377
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 626 place count 1208 transition count 2377
Applied a total of 626 rules in 791 ms. Remains 1208 /1508 variables (removed 300) and now considering 2377/2673 (removed 296) transitions.
// Phase 1: matrix 2377 rows 1208 cols
[2022-06-03 14:18:52] [INFO ] Computed 186 place invariants in 48 ms
[2022-06-03 14:18:53] [INFO ] Implicit Places using invariants in 880 ms returned [113, 122, 129, 130, 189, 226, 232, 233, 237, 242, 243, 299, 325, 333, 339, 347, 352, 353, 461, 468, 469, 527, 546, 552, 555, 557, 560, 567, 622, 664, 677, 743, 766, 772, 775, 777, 778, 785, 791, 793, 847, 882, 884, 886, 893, 945, 963, 969, 974, 980, 1063, 1083, 1183, 1200]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 884 ms to find 54 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1154/1604 places, 2377/2673 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1154 transition count 2376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1153 transition count 2376
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 24 place count 1131 transition count 2354
Iterating global reduction 2 with 22 rules applied. Total rules applied 46 place count 1131 transition count 2354
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 1125 transition count 2348
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 1125 transition count 2348
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 1123 transition count 2346
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 1123 transition count 2346
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1122 transition count 2345
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1122 transition count 2345
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 1115 transition count 2338
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1115 transition count 2337
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 1115 transition count 2330
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 1108 transition count 2330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 1108 transition count 2329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 1107 transition count 2329
Applied a total of 95 rules in 321 ms. Remains 1107 /1154 variables (removed 47) and now considering 2329/2377 (removed 48) transitions.
// Phase 1: matrix 2329 rows 1107 cols
[2022-06-03 14:18:53] [INFO ] Computed 132 place invariants in 38 ms
[2022-06-03 14:18:54] [INFO ] Implicit Places using invariants in 680 ms returned []
// Phase 1: matrix 2329 rows 1107 cols
[2022-06-03 14:18:54] [INFO ] Computed 132 place invariants in 26 ms
[2022-06-03 14:18:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-03 14:18:56] [INFO ] Implicit Places using invariants and state equation in 2803 ms returned []
Implicit Place search using SMT with State Equation took 3488 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1107/1604 places, 2329/2673 transitions.
Finished structural reductions, in 3 iterations. Remains : 1107/1604 places, 2329/2673 transitions.
Incomplete random walk after 1000000 steps, including 9340 resets, run finished after 28080 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 868884 steps, including 844 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
Interrupted Best-First random walk after 944238 steps, including 1097 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 1124 resets, run finished after 4877 ms. (steps per millisecond=205 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1154 resets, run finished after 4848 ms. (steps per millisecond=206 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 13526265 steps, run timeout after 141001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 13526265 steps, saw 1995730 distinct states, run finished after 141002 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2329 rows 1107 cols
[2022-06-03 14:22:05] [INFO ] Computed 132 place invariants in 20 ms
[2022-06-03 14:22:06] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 14:22:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-06-03 14:22:06] [INFO ] [Nat]Absence check using 31 positive and 101 generalized place invariants in 39 ms returned sat
[2022-06-03 14:22:17] [INFO ] After 10986ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-03 14:22:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-06-03 14:22:34] [INFO ] After 17237ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-06-03 14:22:46] [INFO ] Deduced a trap composed of 70 places in 218 ms of which 2 ms to minimize.
[2022-06-03 14:22:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2022-06-03 14:22:46] [INFO ] After 29416ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5988 ms.
[2022-06-03 14:22:52] [INFO ] After 46773ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ASLink-PT-10a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-10a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 15427 ms.
Support contains 119 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1107/1107 places, 2329/2329 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1107 transition count 2323
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 1101 transition count 2320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 1098 transition count 2320
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 18 place count 1098 transition count 2310
Deduced a syphon composed of 10 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 39 place count 1087 transition count 2310
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 1086 transition count 2310
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 44 place count 1082 transition count 2301
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 49 place count 1081 transition count 2301
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 51 place count 1079 transition count 2299
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 1079 transition count 2299
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 73 place count 1069 transition count 2289
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 1069 transition count 2288
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 82 place count 1069 transition count 2280
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 92 place count 1061 transition count 2278
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 93 place count 1061 transition count 2277
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 106 place count 1061 transition count 2264
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 119 place count 1048 transition count 2264
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 121 place count 1048 transition count 2264
Applied a total of 121 rules in 350 ms. Remains 1048 /1107 variables (removed 59) and now considering 2264/2329 (removed 65) transitions.
Finished structural reductions, in 1 iterations. Remains : 1048/1107 places, 2264/2329 transitions.
Incomplete random walk after 1000000 steps, including 11718 resets, run finished after 12527 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1170 resets, run finished after 4232 ms. (steps per millisecond=236 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1355 resets, run finished after 3136 ms. (steps per millisecond=318 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6342249 steps, run timeout after 57001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 6342249 steps, saw 977713 distinct states, run finished after 57001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2264 rows 1048 cols
[2022-06-03 14:24:25] [INFO ] Computed 129 place invariants in 20 ms
[2022-06-03 14:24:25] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:24:25] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2022-06-03 14:24:26] [INFO ] [Nat]Absence check using 28 positive and 101 generalized place invariants in 31 ms returned sat
[2022-06-03 14:24:45] [INFO ] After 19083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 14:24:45] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-03 14:24:54] [INFO ] After 9237ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:24:54] [INFO ] After 28529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6798 ms.
Support contains 119 out of 1048 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1048/1048 places, 2264/2264 transitions.
Applied a total of 0 rules in 42 ms. Remains 1048 /1048 variables (removed 0) and now considering 2264/2264 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1048/1048 places, 2264/2264 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1048/1048 places, 2264/2264 transitions.
Applied a total of 0 rules in 68 ms. Remains 1048 /1048 variables (removed 0) and now considering 2264/2264 (removed 0) transitions.
// Phase 1: matrix 2264 rows 1048 cols
[2022-06-03 14:25:01] [INFO ] Computed 129 place invariants in 20 ms
[2022-06-03 14:25:05] [INFO ] Implicit Places using invariants in 4232 ms returned [146, 225, 377, 386, 393, 400, 419, 771, 927, 932, 1024, 1025]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 4252 ms to find 12 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1036/1048 places, 2264/2264 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1036 transition count 2256
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1028 transition count 2256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 1024 transition count 2252
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 1024 transition count 2252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 1024 transition count 2251
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 1023 transition count 2251
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 1021 transition count 2249
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 1021 transition count 2249
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 2 with 12 rules applied. Total rules applied 42 place count 1015 transition count 2243
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 1015 transition count 2240
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 1012 transition count 2240
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 1012 transition count 2239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 1011 transition count 2239
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 1011 transition count 2239
Applied a total of 52 rules in 226 ms. Remains 1011 /1036 variables (removed 25) and now considering 2239/2264 (removed 25) transitions.
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:25:05] [INFO ] Computed 117 place invariants in 54 ms
[2022-06-03 14:25:06] [INFO ] Implicit Places using invariants in 730 ms returned []
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:25:06] [INFO ] Computed 117 place invariants in 30 ms
[2022-06-03 14:25:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-03 14:25:09] [INFO ] Implicit Places using invariants and state equation in 3095 ms returned []
Implicit Place search using SMT with State Equation took 3840 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1011/1048 places, 2239/2264 transitions.
Finished structural reductions, in 2 iterations. Remains : 1011/1048 places, 2239/2264 transitions.
Incomplete random walk after 1000000 steps, including 11699 resets, run finished after 15281 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1201 resets, run finished after 3745 ms. (steps per millisecond=267 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1378 resets, run finished after 2664 ms. (steps per millisecond=375 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 7054184 steps, run timeout after 63001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 7054184 steps, saw 1209082 distinct states, run finished after 63002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:26:34] [INFO ] Computed 117 place invariants in 39 ms
[2022-06-03 14:26:34] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:26:34] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2022-06-03 14:26:34] [INFO ] [Nat]Absence check using 27 positive and 90 generalized place invariants in 38 ms returned sat
[2022-06-03 14:26:46] [INFO ] After 11094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:26:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-03 14:26:58] [INFO ] After 12691ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:27:07] [INFO ] After 21873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:27:07] [INFO ] After 33273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7786 ms.
Support contains 119 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 2239/2239 transitions.
Applied a total of 0 rules in 43 ms. Remains 1011 /1011 variables (removed 0) and now considering 2239/2239 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 2239/2239 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 2239/2239 transitions.
Applied a total of 0 rules in 41 ms. Remains 1011 /1011 variables (removed 0) and now considering 2239/2239 (removed 0) transitions.
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:27:15] [INFO ] Computed 117 place invariants in 49 ms
[2022-06-03 14:27:16] [INFO ] Implicit Places using invariants in 642 ms returned []
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:27:16] [INFO ] Computed 117 place invariants in 17 ms
[2022-06-03 14:27:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-03 14:27:18] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 3205 ms to find 0 implicit places.
[2022-06-03 14:27:19] [INFO ] Redundant transitions in 149 ms returned []
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:27:19] [INFO ] Computed 117 place invariants in 29 ms
[2022-06-03 14:27:19] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 2239/2239 transitions.
Incomplete random walk after 1000000 steps, including 11900 resets, run finished after 12733 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1175 resets, run finished after 3851 ms. (steps per millisecond=259 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1378 resets, run finished after 3084 ms. (steps per millisecond=324 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5983678 steps, run timeout after 57001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 5983678 steps, saw 1027294 distinct states, run finished after 57001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:28:36] [INFO ] Computed 117 place invariants in 16 ms
[2022-06-03 14:28:36] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:28:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2022-06-03 14:28:37] [INFO ] [Nat]Absence check using 27 positive and 90 generalized place invariants in 31 ms returned sat
[2022-06-03 14:28:47] [INFO ] After 10117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:28:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-03 14:28:59] [INFO ] After 12733ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:29:09] [INFO ] After 21914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-03 14:29:09] [INFO ] After 32260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7247 ms.
Support contains 119 out of 1011 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 2239/2239 transitions.
Applied a total of 0 rules in 36 ms. Remains 1011 /1011 variables (removed 0) and now considering 2239/2239 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 2239/2239 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1011/1011 places, 2239/2239 transitions.
Applied a total of 0 rules in 34 ms. Remains 1011 /1011 variables (removed 0) and now considering 2239/2239 (removed 0) transitions.
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:29:16] [INFO ] Computed 117 place invariants in 17 ms
[2022-06-03 14:29:17] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:29:17] [INFO ] Computed 117 place invariants in 17 ms
[2022-06-03 14:29:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-03 14:29:20] [INFO ] Implicit Places using invariants and state equation in 3622 ms returned []
Implicit Place search using SMT with State Equation took 4172 ms to find 0 implicit places.
[2022-06-03 14:29:20] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 2239 rows 1011 cols
[2022-06-03 14:29:20] [INFO ] Computed 117 place invariants in 16 ms
[2022-06-03 14:29:21] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1011/1011 places, 2239/2239 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 1011 transition count 2235
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1007 transition count 2235
Applied a total of 8 rules in 43 ms. Remains 1007 /1011 variables (removed 4) and now considering 2235/2239 (removed 4) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2235 rows 1007 cols
[2022-06-03 14:29:21] [INFO ] Computed 117 place invariants in 17 ms
[2022-06-03 14:29:21] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 14:29:22] [INFO ] [Nat]Absence check using 27 positive place invariants in 35 ms returned sat
[2022-06-03 14:29:22] [INFO ] [Nat]Absence check using 27 positive and 90 generalized place invariants in 33 ms returned sat
[2022-06-03 14:29:36] [INFO ] After 14048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 14:29:38] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2022-06-03 14:29:38] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2022-06-03 14:29:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 535 ms
[2022-06-03 14:29:42] [INFO ] After 20003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13155 ms.
[2022-06-03 14:29:55] [INFO ] After 33426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 14:29:56] [INFO ] Flatten gal took : 365 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14885065906569107208
[2022-06-03 14:29:56] [INFO ] Too many transitions (2239) to apply POR reductions. Disabling POR matrices.
[2022-06-03 14:29:56] [INFO ] Applying decomposition
[2022-06-03 14:29:56] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14885065906569107208
Running compilation step : cd /tmp/ltsmin14885065906569107208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 14:29:56] [INFO ] Flatten gal took : 351 ms
[2022-06-03 14:29:56] [INFO ] Flatten gal took : 282 ms
Compilation finished in 5276 ms.
Running link step : cd /tmp/ltsmin14885065906569107208;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin14885065906569107208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10aReachabilityFireability02==true'
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14885065906569107208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10aReachabilityFireability02==true'
Running LTSmin : cd /tmp/ltsmin14885065906569107208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT10aReachabilityFireability12==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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-10a"
export BK_EXAMINATION="ReachabilityFireability"
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-10a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245688900159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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