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.r235-tall-167856421900535.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is LeafsetExtension-PT-S64C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678667425914

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 00:30:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:30:27] [INFO ] Load time of PNML (sax parser for PT used): 484 ms
[2023-03-13 00:30:27] [INFO ] Transformed 21462 places.
[2023-03-13 00:30:27] [INFO ] Transformed 21129 transitions.
[2023-03-13 00:30:28] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 721 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 383 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 16) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 00:30:31] [INFO ] Computed 333 place invariants in 2603 ms
[2023-03-13 00:30:36] [INFO ] [Real]Absence check using 67 positive place invariants in 61 ms returned sat
[2023-03-13 00:30:37] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 760 ms returned sat
[2023-03-13 00:30:56] [INFO ] After 16165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2023-03-13 00:30:56] [INFO ] After 16199ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 00:30:56] [INFO ] After 25106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 90 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 9937 are kept as prefixes of interest. Removing 11525 places using SCC suffix rule.33 ms
Discarding 11525 places :
Also discarding 5677 output transitions
Drop transitions removed 5677 transitions
Drop transitions removed 1563 transitions
Reduce isomorphic transitions removed 1563 transitions.
Drop transitions removed 3876 transitions
Trivial Post-agglo rules discarded 3876 transitions
Performed 3876 trivial Post agglomeration. Transition count delta: 3876
Iterating post reduction 0 with 5439 rules applied. Total rules applied 5440 place count 9937 transition count 10013
Reduce places removed 3877 places and 0 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 1 with 3883 rules applied. Total rules applied 9323 place count 6060 transition count 10007
Reduce places removed 6 places and 0 transitions.
Performed 548 Post agglomeration using F-continuation condition.Transition count delta: 548
Iterating post reduction 2 with 554 rules applied. Total rules applied 9877 place count 6054 transition count 9459
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 3 with 548 rules applied. Total rules applied 10425 place count 5506 transition count 9459
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 10425 place count 5506 transition count 9390
Deduced a syphon composed of 69 places in 4 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 10563 place count 5437 transition count 9390
Discarding 2506 places :
Symmetric choice reduction at 4 with 2506 rule applications. Total rules 13069 place count 2931 transition count 6884
Iterating global reduction 4 with 2506 rules applied. Total rules applied 15575 place count 2931 transition count 6884
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 15606 place count 2900 transition count 6853
Iterating global reduction 4 with 31 rules applied. Total rules applied 15637 place count 2900 transition count 6853
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 15638 place count 2899 transition count 6853
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 15640 place count 2898 transition count 6852
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 15645 place count 2898 transition count 6847
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 15650 place count 2893 transition count 6847
Partial Free-agglomeration rule applied 227 times.
Drop transitions removed 227 transitions
Iterating global reduction 6 with 227 rules applied. Total rules applied 15877 place count 2893 transition count 6847
Applied a total of 15877 rules in 3340 ms. Remains 2893 /21462 variables (removed 18569) and now considering 6847/21129 (removed 14282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3342 ms. Remains : 2893/21462 places, 6847/21129 transitions.
Incomplete random walk after 10000 steps, including 790 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 10) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 00:31:00] [INFO ] Flow matrix only has 5138 transitions (discarded 1709 similar events)
// Phase 1: matrix 5138 rows 2893 cols
[2023-03-13 00:31:00] [INFO ] Computed 109 place invariants in 81 ms
[2023-03-13 00:31:01] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 38 ms returned sat
[2023-03-13 00:31:01] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:31:02] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 35 ms returned sat
[2023-03-13 00:31:06] [INFO ] After 3319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 00:31:08] [INFO ] After 5994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2089 ms.
[2023-03-13 00:31:10] [INFO ] After 8972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 39 ms.
Support contains 88 out of 2893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2893/2893 places, 6847/6847 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2893 transition count 6845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2891 transition count 6845
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 2891 transition count 6845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 2890 transition count 6844
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 2890 transition count 6844
Applied a total of 7 rules in 649 ms. Remains 2890 /2893 variables (removed 3) and now considering 6844/6847 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 2890/2893 places, 6844/6847 transitions.
Incomplete random walk after 10000 steps, including 794 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 8) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 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 23 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 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 00:31:12] [INFO ] Flow matrix only has 5135 transitions (discarded 1709 similar events)
// Phase 1: matrix 5135 rows 2890 cols
[2023-03-13 00:31:12] [INFO ] Computed 109 place invariants in 49 ms
[2023-03-13 00:31:12] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 38 ms returned sat
[2023-03-13 00:31:12] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 00:31:13] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 36 ms returned sat
[2023-03-13 00:31:16] [INFO ] After 3083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 00:31:19] [INFO ] After 5337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2102 ms.
[2023-03-13 00:31:21] [INFO ] After 8238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 12 ms.
Support contains 85 out of 2890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2890/2890 places, 6844/6844 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2890 transition count 6842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 2888 transition count 6842
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 2888 transition count 6842
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 2887 transition count 6841
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 2887 transition count 6841
Applied a total of 7 rules in 636 ms. Remains 2887 /2890 variables (removed 3) and now considering 6841/6844 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 636 ms. Remains : 2887/2890 places, 6841/6844 transitions.
Incomplete random walk after 10000 steps, including 789 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 7) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 00:31:22] [INFO ] Flow matrix only has 5132 transitions (discarded 1709 similar events)
// Phase 1: matrix 5132 rows 2887 cols
[2023-03-13 00:31:22] [INFO ] Computed 109 place invariants in 51 ms
[2023-03-13 00:31:22] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 35 ms returned sat
[2023-03-13 00:31:23] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:31:23] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 34 ms returned sat
[2023-03-13 00:31:26] [INFO ] After 3087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 00:31:28] [INFO ] After 5196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1625 ms.
[2023-03-13 00:31:30] [INFO ] After 7543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 13 ms.
Support contains 84 out of 2887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2887/2887 places, 6841/6841 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 1 place count 2887 transition count 6840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2886 transition count 6840
Applied a total of 2 rules in 231 ms. Remains 2886 /2887 variables (removed 1) and now considering 6840/6841 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 2886/2887 places, 6840/6841 transitions.
Incomplete random walk after 10000 steps, including 794 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 24555 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{4=1}
Probabilistic random walk after 24555 steps, saw 12089 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-13 00:31:34] [INFO ] Flow matrix only has 5131 transitions (discarded 1709 similar events)
// Phase 1: matrix 5131 rows 2886 cols
[2023-03-13 00:31:34] [INFO ] Computed 109 place invariants in 49 ms
[2023-03-13 00:31:34] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 34 ms returned sat
[2023-03-13 00:31:37] [INFO ] After 2594ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-13 00:31:39] [INFO ] After 4189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 557 ms.
[2023-03-13 00:31:39] [INFO ] After 5425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2023-03-13 00:31:40] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 34 ms returned sat
[2023-03-13 00:31:43] [INFO ] After 2856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:31:45] [INFO ] After 4848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1393 ms.
[2023-03-13 00:31:46] [INFO ] After 6903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 6 ms.
Support contains 83 out of 2886 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2886/2886 places, 6840/6840 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 1 place count 2886 transition count 6839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2885 transition count 6839
Applied a total of 2 rules in 236 ms. Remains 2885 /2886 variables (removed 1) and now considering 6839/6840 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 2885/2886 places, 6839/6840 transitions.
Incomplete random walk after 10000 steps, including 801 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
[2023-03-13 00:31:47] [INFO ] Flow matrix only has 5130 transitions (discarded 1709 similar events)
// Phase 1: matrix 5130 rows 2885 cols
[2023-03-13 00:31:47] [INFO ] Computed 109 place invariants in 47 ms
[2023-03-13 00:31:47] [INFO ] [Real]Absence check using 0 positive and 109 generalized place invariants in 37 ms returned sat
[2023-03-13 00:31:50] [INFO ] After 2821ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-13 00:31:52] [INFO ] After 4486ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-13 00:31:52] [INFO ] After 5663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:1
[2023-03-13 00:31:53] [INFO ] [Nat]Absence check using 0 positive and 109 generalized place invariants in 34 ms returned sat
[2023-03-13 00:31:56] [INFO ] After 2559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:31:57] [INFO ] After 4229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1204 ms.
[2023-03-13 00:31:58] [INFO ] After 5999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 48 out of 2885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2885/2885 places, 6839/6839 transitions.
Graph (complete) has 14816 edges and 2885 vertex of which 2730 are kept as prefixes of interest. Removing 155 places using SCC suffix rule.2 ms
Discarding 155 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 2730 transition count 6685
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 145 place count 2727 transition count 6685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 2727 transition count 6684
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 147 place count 2726 transition count 6684
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 2717 transition count 6675
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 2717 transition count 6675
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 2717 transition count 6673
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 2715 transition count 6673
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 196 place count 2715 transition count 6673
Applied a total of 196 rules in 806 ms. Remains 2715 /2885 variables (removed 170) and now considering 6673/6839 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 2715/2885 places, 6673/6839 transitions.
Incomplete random walk after 10000 steps, including 798 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 24496 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24496 steps, saw 11948 distinct states, run finished after 3005 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 00:32:03] [INFO ] Flow matrix only has 4825 transitions (discarded 1848 similar events)
// Phase 1: matrix 4825 rows 2715 cols
[2023-03-13 00:32:03] [INFO ] Computed 102 place invariants in 43 ms
[2023-03-13 00:32:03] [INFO ] [Real]Absence check using 0 positive and 102 generalized place invariants in 33 ms returned sat
[2023-03-13 00:32:05] [INFO ] After 2131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-13 00:32:06] [INFO ] After 2694ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 529 ms.
[2023-03-13 00:32:06] [INFO ] After 3764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2023-03-13 00:32:07] [INFO ] [Nat]Absence check using 0 positive and 102 generalized place invariants in 32 ms returned sat
[2023-03-13 00:32:09] [INFO ] After 2450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 00:32:11] [INFO ] After 3777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1222 ms.
[2023-03-13 00:32:12] [INFO ] After 5541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 48 out of 2715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2715/2715 places, 6673/6673 transitions.
Applied a total of 0 rules in 191 ms. Remains 2715 /2715 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 2715/2715 places, 6673/6673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2715/2715 places, 6673/6673 transitions.
Applied a total of 0 rules in 195 ms. Remains 2715 /2715 variables (removed 0) and now considering 6673/6673 (removed 0) transitions.
[2023-03-13 00:32:12] [INFO ] Flow matrix only has 4825 transitions (discarded 1848 similar events)
[2023-03-13 00:32:12] [INFO ] Invariant cache hit.
[2023-03-13 00:32:15] [INFO ] Implicit Places using invariants in 2144 ms returned [5, 74, 112, 150, 226, 263, 300, 337, 374, 445, 483, 520, 557, 596, 708, 745, 782, 819, 856, 932, 969, 1040, 1078, 1115, 1189, 1226, 1263, 1300, 1336, 1338, 1377, 1411, 1414, 1448, 1451, 1485, 1488, 1522, 1525, 1559, 1562, 1596, 1636, 1673, 1709, 1749, 1752, 1786, 1789, 1823, 1826, 1860, 1863, 1897, 1902, 1936, 1940, 1977, 2011, 2014, 2048, 2051, 2085, 2088, 2122, 2125, 2159, 2162, 2196, 2199, 2234, 2238, 2272, 2277, 2311, 2314, 2348, 2387, 2390, 2424, 2463, 2466, 2500, 2503, 2538, 2575, 2610, 2613, 2647]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 2150 ms to find 89 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2626/2715 places, 6673/6673 transitions.
Discarding 1968 places :
Symmetric choice reduction at 0 with 1968 rule applications. Total rules 1968 place count 658 transition count 4705
Iterating global reduction 0 with 1968 rules applied. Total rules applied 3936 place count 658 transition count 4705
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 3992 place count 602 transition count 4649
Iterating global reduction 0 with 56 rules applied. Total rules applied 4048 place count 602 transition count 4649
Discarding 136 places :
Symmetric choice reduction at 0 with 136 rule applications. Total rules 4184 place count 466 transition count 4513
Iterating global reduction 0 with 136 rules applied. Total rules applied 4320 place count 466 transition count 4513
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 4342 place count 455 transition count 4502
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 4367 place count 455 transition count 4477
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 4392 place count 430 transition count 4477
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4393 place count 430 transition count 4477
Applied a total of 4393 rules in 307 ms. Remains 430 /2626 variables (removed 2196) and now considering 4477/6673 (removed 2196) transitions.
[2023-03-13 00:32:15] [INFO ] Flow matrix only has 843 transitions (discarded 3634 similar events)
// Phase 1: matrix 843 rows 430 cols
[2023-03-13 00:32:15] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-13 00:32:15] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-13 00:32:15] [INFO ] Flow matrix only has 843 transitions (discarded 3634 similar events)
[2023-03-13 00:32:15] [INFO ] Invariant cache hit.
[2023-03-13 00:32:17] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned [7, 43, 50, 59, 62, 65, 68, 71, 74, 110, 112, 115, 118, 127, 171, 174, 177, 180, 183, 186, 195, 198, 201, 237, 239, 242, 246, 252, 255, 258, 261, 264, 267, 417]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 2094 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 396/2715 places, 4477/6673 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 4474
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 4474
Discarding 174 places :
Symmetric choice reduction at 0 with 174 rule applications. Total rules 180 place count 219 transition count 4300
Iterating global reduction 0 with 174 rules applied. Total rules applied 354 place count 219 transition count 4300
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 366 place count 213 transition count 4294
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 391 place count 213 transition count 4269
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 416 place count 188 transition count 4269
Applied a total of 416 rules in 152 ms. Remains 188 /396 variables (removed 208) and now considering 4269/4477 (removed 208) transitions.
[2023-03-13 00:32:17] [INFO ] Flow matrix only has 629 transitions (discarded 3640 similar events)
// Phase 1: matrix 629 rows 188 cols
[2023-03-13 00:32:17] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-13 00:32:17] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-13 00:32:17] [INFO ] Flow matrix only has 629 transitions (discarded 3640 similar events)
[2023-03-13 00:32:17] [INFO ] Invariant cache hit.
[2023-03-13 00:32:18] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 188/2715 places, 4269/6673 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5787 ms. Remains : 188/2715 places, 4269/6673 transitions.
Incomplete random walk after 10000 steps, including 1060 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 110924 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{2=1}
Probabilistic random walk after 110924 steps, saw 31822 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-13 00:32:21] [INFO ] Flow matrix only has 629 transitions (discarded 3640 similar events)
[2023-03-13 00:32:21] [INFO ] Invariant cache hit.
[2023-03-13 00:32:21] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-13 00:32:21] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 00:32:22] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-13 00:32:22] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:32:22] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-13 00:32:22] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 37 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 4269/4269 transitions.
Graph (complete) has 1235 edges and 188 vertex of which 181 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 181 transition count 4261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 179 transition count 4261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 179 transition count 4260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 178 transition count 4260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 12 place count 173 transition count 4255
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 173 transition count 4255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 171 transition count 4253
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 171 transition count 4251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 169 transition count 4251
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 169 transition count 4251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 168 transition count 4250
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 168 transition count 4250
Applied a total of 29 rules in 258 ms. Remains 168 /188 variables (removed 20) and now considering 4250/4269 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 168/188 places, 4250/4269 transitions.
Incomplete random walk after 10000 steps, including 1163 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 126744 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126744 steps, saw 33610 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 00:32:26] [INFO ] Flow matrix only has 545 transitions (discarded 3705 similar events)
// Phase 1: matrix 545 rows 168 cols
[2023-03-13 00:32:26] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-13 00:32:26] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-13 00:32:26] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-13 00:32:26] [INFO ] After 310ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-13 00:32:26] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 37 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 4250/4250 transitions.
Applied a total of 0 rules in 64 ms. Remains 168 /168 variables (removed 0) and now considering 4250/4250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 168/168 places, 4250/4250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 4250/4250 transitions.
Applied a total of 0 rules in 63 ms. Remains 168 /168 variables (removed 0) and now considering 4250/4250 (removed 0) transitions.
[2023-03-13 00:32:26] [INFO ] Flow matrix only has 545 transitions (discarded 3705 similar events)
[2023-03-13 00:32:26] [INFO ] Invariant cache hit.
[2023-03-13 00:32:27] [INFO ] Implicit Places using invariants in 289 ms returned [90, 144]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/168 places, 4250/4250 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 4248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 4248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 162 transition count 4246
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 162 transition count 4246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 161 transition count 4245
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 161 transition count 4245
Applied a total of 10 rules in 98 ms. Remains 161 /166 variables (removed 5) and now considering 4245/4250 (removed 5) transitions.
[2023-03-13 00:32:27] [INFO ] Flow matrix only has 477 transitions (discarded 3768 similar events)
// Phase 1: matrix 477 rows 161 cols
[2023-03-13 00:32:27] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-13 00:32:27] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-13 00:32:27] [INFO ] Flow matrix only has 477 transitions (discarded 3768 similar events)
[2023-03-13 00:32:27] [INFO ] Invariant cache hit.
[2023-03-13 00:32:27] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 161/168 places, 4245/4250 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1222 ms. Remains : 161/168 places, 4245/4250 transitions.
Incomplete random walk after 10000 steps, including 1123 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 127818 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127818 steps, saw 34113 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 00:32:31] [INFO ] Flow matrix only has 477 transitions (discarded 3768 similar events)
[2023-03-13 00:32:31] [INFO ] Invariant cache hit.
[2023-03-13 00:32:31] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 00:32:31] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-13 00:32:31] [INFO ] After 288ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-13 00:32:31] [INFO ] After 424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 37 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 4245/4245 transitions.
Applied a total of 0 rules in 77 ms. Remains 161 /161 variables (removed 0) and now considering 4245/4245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 161/161 places, 4245/4245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 4245/4245 transitions.
Applied a total of 0 rules in 64 ms. Remains 161 /161 variables (removed 0) and now considering 4245/4245 (removed 0) transitions.
[2023-03-13 00:32:31] [INFO ] Flow matrix only has 477 transitions (discarded 3768 similar events)
[2023-03-13 00:32:31] [INFO ] Invariant cache hit.
[2023-03-13 00:32:32] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-13 00:32:32] [INFO ] Flow matrix only has 477 transitions (discarded 3768 similar events)
[2023-03-13 00:32:32] [INFO ] Invariant cache hit.
[2023-03-13 00:32:32] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-13 00:32:32] [INFO ] Redundant transitions in 361 ms returned []
[2023-03-13 00:32:32] [INFO ] Flow matrix only has 477 transitions (discarded 3768 similar events)
[2023-03-13 00:32:32] [INFO ] Invariant cache hit.
[2023-03-13 00:32:33] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2211 ms. Remains : 161/161 places, 4245/4245 transitions.
Drop transitions removed 1649 transitions
Ensure Unique test removed 2147 transitions
Reduce isomorphic transitions removed 3796 transitions.
Iterating post reduction 0 with 3796 rules applied. Total rules applied 3796 place count 161 transition count 449
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 3796 place count 161 transition count 444
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 3806 place count 156 transition count 444
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 3842 place count 120 transition count 237
Iterating global reduction 1 with 36 rules applied. Total rules applied 3878 place count 120 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3880 place count 119 transition count 236
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 3884 place count 117 transition count 249
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 3899 place count 117 transition count 234
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 3917 place count 102 transition count 231
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3918 place count 102 transition count 230
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 3930 place count 102 transition count 218
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 3942 place count 90 transition count 218
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 3944 place count 90 transition count 216
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 3980 place count 90 transition count 216
Applied a total of 3980 rules in 21 ms. Remains 90 /161 variables (removed 71) and now considering 216/4245 (removed 4029) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 216 rows 90 cols
[2023-03-13 00:32:34] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 00:32:34] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 1 ms returned sat
[2023-03-13 00:32:34] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 00:32:34] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-13 00:32:34] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 00:32:34] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-13 00:32:34] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 00:32:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-13 00:32:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 4245 transitions and 18553 arcs took 20 ms.
[2023-03-13 00:32:34] [INFO ] Flatten gal took : 308 ms
Total runtime 127472 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LeafsetExtension (PT), instance S64C3
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 161 places, 4245 transitions, 18553 arcs.
Final Score: 17975.323
Took : 69 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678667625831

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 23032:
syntax error

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="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is LeafsetExtension-PT-S64C3, 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 r235-tall-167856421900535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C3.tgz
mv LeafsetExtension-PT-S64C3 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 ;