About the Execution of GreatSPN+red for EnergyBus-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9343.140 | 146554.00 | 253789.00 | 534.20 | FTTTFTFTFTTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r157-smll-171636265300222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is EnergyBus-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265300222
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.2M May 18 16:42 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 EnergyBus-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716554672298
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 12:44:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 12:44:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:44:34] [INFO ] Load time of PNML (sax parser for PT used): 592 ms
[2024-05-24 12:44:34] [INFO ] Transformed 157 places.
[2024-05-24 12:44:34] [INFO ] Transformed 4430 transitions.
[2024-05-24 12:44:34] [INFO ] Found NUPN structural information;
[2024-05-24 12:44:35] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 899 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 190 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4260 ms. (9 steps per ms) remains 5/13 properties
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
[2024-05-24 12:44:37] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2024-05-24 12:44:37] [INFO ] Computed 23 invariants in 28 ms
[2024-05-24 12:44:37] [INFO ] State equation strengthened by 463 read => feed constraints.
Problem EnergyBus-PT-none-ReachabilityCardinality-2024-06 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem EnergyBus-PT-none-ReachabilityCardinality-2024-08 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 75/132 variables, 18/75 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 75/150 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/139 variables, 3/153 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 7/160 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/148 variables, 2/162 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 9/171 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 640/788 variables, 148/319 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 239/558 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/788 variables, 0/558 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 10/798 variables, 4/562 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 4/566 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 223/789 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 0/789 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/799 variables, 1/790 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/799 variables, 1/791 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/799 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/800 variables, 1/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/800 variables, 0/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/800 variables, 0/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 792 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1652 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 153/153 constraints, ReadFeed: 463/463 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 86/132 variables, 18/64 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 86/150 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/139 variables, 3/153 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 7/160 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 12:44:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/161 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/148 variables, 2/163 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 9/172 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-24 12:44:40] [INFO ] Deduced a trap composed of 18 places in 894 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/173 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 640/788 variables, 148/321 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 239/560 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/560 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 10/798 variables, 4/564 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 4/568 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/798 variables, 223/791 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/798 variables, 0/791 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/799 variables, 1/792 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/799 variables, 1/793 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/799 variables, 3/796 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/799 variables, 0/796 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/800 variables, 1/797 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/800 variables, 0/797 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/800 variables, 0/797 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 800/800 variables, and 797 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4167 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 153/153 constraints, ReadFeed: 463/463 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 6227ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3997 ms.
Support contains 46 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 70 edges and 153 vertex of which 8 / 153 are part of one of the 3 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 429 transitions
Reduce isomorphic transitions removed 446 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 1466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 147 transition count 1466
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 147 transition count 1462
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 143 transition count 1462
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 24 place count 130 transition count 1120
Iterating global reduction 2 with 13 rules applied. Total rules applied 37 place count 130 transition count 1120
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 125 transition count 1115
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 125 transition count 1114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 124 transition count 1118
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 124 transition count 1117
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 4 with 71 rules applied. Total rules applied 122 place count 124 transition count 1046
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 124 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 123 transition count 1045
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 124 place count 123 transition count 1043
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 128 place count 121 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 129 place count 120 transition count 1042
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 120 transition count 1042
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 119 transition count 1041
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 142 place count 119 transition count 1031
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 152 place count 109 transition count 1031
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 154 place count 109 transition count 1029
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 109 transition count 1028
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 156 place count 108 transition count 1028
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 158 place count 108 transition count 1028
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 159 place count 108 transition count 1028
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 160 place count 108 transition count 1027
Applied a total of 160 rules in 1357 ms. Remains 108 /153 variables (removed 45) and now considering 1027/1913 (removed 886) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1373 ms. Remains : 108/153 places, 1027/1913 transitions.
RANDOM walk for 40000 steps (8 resets) in 543 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 247723 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 3
Probabilistic random walk after 247723 steps, saw 136544 distinct states, run finished after 3023 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-24 12:44:52] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
// Phase 1: matrix 445 rows 108 cols
[2024-05-24 12:44:52] [INFO ] Computed 23 invariants in 4 ms
[2024-05-24 12:44:52] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/94 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/101 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/106 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 443/549 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 181/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/553 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 161/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/553 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 473 constraints, problems are : Problem set: 0 solved, 3 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/94 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:44:52] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/101 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/106 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:44:53] [INFO ] Deduced a trap composed of 15 places in 350 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 443/549 variables, 106/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 181/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:44:53] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/553 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 161/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:44:54] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2317 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2942ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 750 ms.
Support contains 46 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 1027/1027 transitions.
Applied a total of 0 rules in 109 ms. Remains 108 /108 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 108/108 places, 1027/1027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 1027/1027 transitions.
Applied a total of 0 rules in 92 ms. Remains 108 /108 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-24 12:44:56] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:44:56] [INFO ] Invariant cache hit.
[2024-05-24 12:44:56] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-24 12:44:56] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:44:56] [INFO ] Invariant cache hit.
[2024-05-24 12:44:56] [INFO ] State equation strengthened by 342 read => feed constraints.
[2024-05-24 12:44:56] [INFO ] Implicit Places using invariants and state equation in 731 ms returned [19, 85]
[2024-05-24 12:44:56] [INFO ] Actually due to overlaps returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 968 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/108 places, 1027/1027 transitions.
Applied a total of 0 rules in 87 ms. Remains 107 /107 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1148 ms. Remains : 107/108 places, 1027/1027 transitions.
RANDOM walk for 40000 steps (8 resets) in 418 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 262346 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 3
Probabilistic random walk after 262346 steps, saw 143799 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-24 12:45:00] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
// Phase 1: matrix 445 rows 107 cols
[2024-05-24 12:45:00] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 12:45:00] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/94 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/99 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/104 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 443/547 variables, 104/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 181/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 5/552 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 161/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/552 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/94 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:01] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/99 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/104 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:01] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 443/547 variables, 104/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 181/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:01] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/552 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 161/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:02] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/552 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2389 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2969ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1465 ms.
Support contains 46 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 1027/1027 transitions.
Applied a total of 0 rules in 87 ms. Remains 107 /107 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 107/107 places, 1027/1027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 1027/1027 transitions.
Applied a total of 0 rules in 88 ms. Remains 107 /107 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-24 12:45:04] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:45:04] [INFO ] Invariant cache hit.
[2024-05-24 12:45:05] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-24 12:45:05] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:45:05] [INFO ] Invariant cache hit.
[2024-05-24 12:45:05] [INFO ] State equation strengthened by 342 read => feed constraints.
[2024-05-24 12:45:05] [INFO ] Implicit Places using invariants and state equation in 670 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 865 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/107 places, 1027/1027 transitions.
Applied a total of 0 rules in 98 ms. Remains 106 /106 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1051 ms. Remains : 106/107 places, 1027/1027 transitions.
RANDOM walk for 40000 steps (8 resets) in 425 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 306684 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 3
Probabilistic random walk after 306684 steps, saw 166270 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-24 12:45:09] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
// Phase 1: matrix 445 rows 106 cols
[2024-05-24 12:45:09] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:45:09] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/94 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/97 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/102 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 442/544 variables, 102/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 180/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/551 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 162/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/551 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 469 constraints, problems are : Problem set: 0 solved, 3 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/94 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:09] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2024-05-24 12:45:10] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/102 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:10] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 442/544 variables, 102/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 180/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 12:45:10] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 7/551 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 162/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/551 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/551 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/551 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 477 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2810ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 723 ms.
Support contains 46 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 1027/1027 transitions.
Applied a total of 0 rules in 87 ms. Remains 106 /106 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 106/106 places, 1027/1027 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 1027/1027 transitions.
Applied a total of 0 rules in 87 ms. Remains 106 /106 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-24 12:45:12] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:45:12] [INFO ] Invariant cache hit.
[2024-05-24 12:45:12] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-24 12:45:12] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:45:12] [INFO ] Invariant cache hit.
[2024-05-24 12:45:13] [INFO ] State equation strengthened by 342 read => feed constraints.
[2024-05-24 12:45:13] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2024-05-24 12:45:13] [INFO ] Redundant transitions in 87 ms returned []
Running 1026 sub problems to find dead transitions.
[2024-05-24 12:45:13] [INFO ] Flow matrix only has 445 transitions (discarded 582 similar events)
[2024-05-24 12:45:13] [INFO ] Invariant cache hit.
[2024-05-24 12:45:13] [INFO ] State equation strengthened by 342 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-24 12:45:36] [INFO ] Deduced a trap composed of 15 places in 350 ms of which 1 ms to minimize.
[2024-05-24 12:45:36] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2024-05-24 12:45:37] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-24 12:45:37] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 5 (OVERLAPS) 445/551 variables, 106/131 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 342/473 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 473 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 5 (OVERLAPS) 445/551 variables, 106/131 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 342/473 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 1499 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 33111 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 4/4 constraints]
After SMT, in 77026ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 77044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78151 ms. Remains : 106/106 places, 1027/1027 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 12 edges and 106 vertex of which 2 / 106 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 580 transitions
Reduce isomorphic transitions removed 585 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 105 transition count 441
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 441
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 9 place count 101 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 32 place count 101 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 101 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 100 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 99 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 99 transition count 413
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 99 transition count 412
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 98 transition count 411
Applied a total of 39 rules in 53 ms. Remains 98 /106 variables (removed 8) and now considering 411/1027 (removed 616) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 411 rows 98 cols
[2024-05-24 12:46:30] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 12:46:30] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:46:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 12:46:31] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 12:46:31] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:46:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:46:31] [INFO ] After 161ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 12:46:31] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 12:46:31] [INFO ] After 912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1073 ms.
[2024-05-24 12:46:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-24 12:46:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 1027 transitions and 13915 arcs took 22 ms.
[2024-05-24 12:46:32] [INFO ] Flatten gal took : 537 ms
Total runtime 118783 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running EnergyBus-PT-none
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 106
TRANSITIONS: 1027
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.085s, Sys 0.008s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 675
MODEL NAME: /home/mcc/execution/416/model
106 places, 1027 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716554818852
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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="EnergyBus-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is EnergyBus-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265300222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;