MCC'2024- Execution of r157-smll-171636265300223

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
16206.415	590500.00	1351061.00	1976.60	TFFTFFTFFFFTFFTT	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-171636265300223.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265300223
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716554831413

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:47:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 12:47:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:47:14] [INFO ] Load time of PNML (sax parser for PT used): 1035 ms
[2024-05-24 12:47:14] [INFO ] Transformed 157 places.
[2024-05-24 12:47:14] [INFO ] Transformed 4430 transitions.
[2024-05-24 12:47:14] [INFO ] Found NUPN structural information;
[2024-05-24 12:47:14] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 1405 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 59 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 41 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-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6656 ms. (6 steps per ms) remains 12/13 properties
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 858 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1853 ms. (21 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 359337 steps, run timeout after 9001 ms. (steps per millisecond=39 ) properties seen :1 out of 12
Probabilistic random walk after 359337 steps, saw 200123 distinct states, run finished after 9018 ms. (steps per millisecond=39 ) properties seen :1
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 12:47:27] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2024-05-24 12:47:27] [INFO ] Computed 23 invariants in 39 ms
[2024-05-24 12:47:28] [INFO ] State equation strengthened by 463 read => feed constraints.
Problem EnergyBus-PT-none-ReachabilityFireability-2024-05 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem EnergyBus-PT-none-ReachabilityFireability-2024-04 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem EnergyBus-PT-none-ReachabilityFireability-2024-10 is UNSAT
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 55/99 variables, 10/54 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 55/109 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 39/138 variables, 11/120 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 39/159 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 11/149 variables, 2/161 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 11/172 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 643/792 variables, 149/321 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/792 variables, 462/783 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/792 variables, 0/783 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 7/799 variables, 4/787 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/799 variables, 4/791 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/799 variables, 0/791 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/800 variables, 1/792 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/800 variables, 0/792 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/800 variables, 0/792 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 800/800 variables, and 792 constraints, problems are : Problem set: 3 solved, 8 unsolved in 3648 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: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 57/98 variables, 10/51 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 57/108 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/108 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 39/137 variables, 11/119 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 39/158 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 12/149 variables, 2/160 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 12/172 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 643/792 variables, 149/321 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/792 variables, 462/783 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/792 variables, 0/783 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 7/799 variables, 4/787 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/799 variables, 4/791 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/799 variables, 8/799 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-05-24 12:47:37] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/800 variables, and 800 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5011 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: 462/463 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 9938ms problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 75 edges and 153 vertex of which 13 / 153 are part of one of the 4 SCC in 4 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 793 edges and 144 vertex of which 140 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.39 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 140 transition count 1874
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 137 transition count 1872
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 137 transition count 1867
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 22 place count 132 transition count 1867
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 37 place count 117 transition count 1839
Iterating global reduction 2 with 15 rules applied. Total rules applied 52 place count 117 transition count 1839
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 64 place count 111 transition count 1833
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 111 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 110 transition count 1830
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 110 transition count 1830
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 105 transition count 1840
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 85 place count 105 transition count 1832
Drop transitions (Redundant composition of simpler transitions.) removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 171 place count 105 transition count 1746
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 173 place count 104 transition count 1745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 103 transition count 1745
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 174 place count 103 transition count 1742
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 180 place count 100 transition count 1742
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 186 place count 97 transition count 1739
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 97 transition count 1736
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 193 place count 94 transition count 1735
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 94 transition count 1734
Applied a total of 194 rules in 2263 ms. Remains 94 /153 variables (removed 59) and now considering 1734/1913 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2279 ms. Remains : 94/153 places, 1734/1913 transitions.
RANDOM walk for 40000 steps (8 resets) in 1506 ms. (26 steps per ms) remains 7/8 properties
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 6/7 properties
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 12:47:41] [INFO ] Flow matrix only has 528 transitions (discarded 1206 similar events)
// Phase 1: matrix 528 rows 94 cols
[2024-05-24 12:47:41] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 12:47:41] [INFO ] State equation strengthened by 459 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/90 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/92 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 527/619 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 458/571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/622 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/622 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 574 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1199 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 459/459 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 28/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/90 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/92 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 527/619 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 458/571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/622 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/622 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 12:47:46] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/622 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 581 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6346 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 459/459 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 7899ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4670 ms.
Support contains 40 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 1734/1734 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 1733
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 1733
Applied a total of 2 rules in 587 ms. Remains 93 /94 variables (removed 1) and now considering 1733/1734 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 93/94 places, 1733/1734 transitions.
RANDOM walk for 40000 steps (8 resets) in 1650 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 148431 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 148431 steps, saw 76917 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 12:47:58] [INFO ] Flow matrix only has 527 transitions (discarded 1206 similar events)
// Phase 1: matrix 527 rows 93 cols
[2024-05-24 12:47:58] [INFO ] Computed 21 invariants in 8 ms
[2024-05-24 12:47:58] [INFO ] State equation strengthened by 459 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/89 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/91 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 526/617 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 458/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/620 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/620 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/620 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 620/620 variables, and 573 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 459/459 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 22/89 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/91 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 526/617 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 458/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/620 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/620 variables, 6/579 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 12:48:02] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/620 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 620/620 variables, and 580 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 459/459 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 6463ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5123 ms.
Support contains 40 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 1733/1733 transitions.
Applied a total of 0 rules in 272 ms. Remains 93 /93 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 93/93 places, 1733/1733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 1733/1733 transitions.
Applied a total of 0 rules in 269 ms. Remains 93 /93 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
[2024-05-24 12:48:10] [INFO ] Flow matrix only has 527 transitions (discarded 1206 similar events)
[2024-05-24 12:48:10] [INFO ] Invariant cache hit.
[2024-05-24 12:48:10] [INFO ] Implicit Places using invariants in 129 ms returned [5, 30, 74]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 146 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/93 places, 1733/1733 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 1732
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 1731
Applied a total of 3 rules in 550 ms. Remains 89 /90 variables (removed 1) and now considering 1731/1733 (removed 2) transitions.
[2024-05-24 12:48:11] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
// Phase 1: matrix 525 rows 89 cols
[2024-05-24 12:48:11] [INFO ] Computed 18 invariants in 4 ms
[2024-05-24 12:48:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 12:48:11] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
[2024-05-24 12:48:11] [INFO ] Invariant cache hit.
[2024-05-24 12:48:11] [INFO ] State equation strengthened by 449 read => feed constraints.
[2024-05-24 12:48:11] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [13, 66]
[2024-05-24 12:48:11] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 624 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 88/93 places, 1731/1733 transitions.
Applied a total of 0 rules in 267 ms. Remains 88 /88 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1857 ms. Remains : 88/93 places, 1731/1733 transitions.
RANDOM walk for 40000 steps (8 resets) in 1240 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 172855 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 6
Probabilistic random walk after 172855 steps, saw 87471 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-24 12:48:15] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
// Phase 1: matrix 525 rows 88 cols
[2024-05-24 12:48:15] [INFO ] Computed 17 invariants in 10 ms
[2024-05-24 12:48:15] [INFO ] State equation strengthened by 449 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 26/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 524/609 variables, 85/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 448/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/613 variables, 3/553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/613 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 554 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 449/449 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 26/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 12:48:17] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/85 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 524/609 variables, 85/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 448/551 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 12:48:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/613 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/613 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/613 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 562 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4218 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 449/449 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 5719ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4129 ms.
Support contains 40 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1731/1731 transitions.
Applied a total of 0 rules in 266 ms. Remains 88 /88 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 88/88 places, 1731/1731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1731/1731 transitions.
Applied a total of 0 rules in 271 ms. Remains 88 /88 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
[2024-05-24 12:48:26] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
[2024-05-24 12:48:26] [INFO ] Invariant cache hit.
[2024-05-24 12:48:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 12:48:26] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
[2024-05-24 12:48:26] [INFO ] Invariant cache hit.
[2024-05-24 12:48:26] [INFO ] State equation strengthened by 449 read => feed constraints.
[2024-05-24 12:48:26] [INFO ] Implicit Places using invariants and state equation in 468 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 551 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/88 places, 1731/1731 transitions.
Applied a total of 0 rules in 266 ms. Remains 87 /87 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1089 ms. Remains : 87/88 places, 1731/1731 transitions.
RANDOM walk for 40000 steps (8 resets) in 1228 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 284 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 158304 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 6
Probabilistic random walk after 158304 steps, saw 80649 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-24 12:48:31] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
// Phase 1: matrix 525 rows 87 cols
[2024-05-24 12:48:31] [INFO ] Computed 16 invariants in 7 ms
[2024-05-24 12:48:31] [INFO ] State equation strengthened by 449 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/83 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 524/608 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 448/548 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/612 variables, 3/551 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/612 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 552 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 449/449 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/83 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 12:48:32] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/84 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 524/608 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 448/549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/612 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 6/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/612 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 559 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4294 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 449/449 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5983ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5852 ms.
Support contains 40 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1731/1731 transitions.
Applied a total of 0 rules in 263 ms. Remains 87 /87 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 87/87 places, 1731/1731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1731/1731 transitions.
Applied a total of 0 rules in 264 ms. Remains 87 /87 variables (removed 0) and now considering 1731/1731 (removed 0) transitions.
[2024-05-24 12:48:43] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
[2024-05-24 12:48:43] [INFO ] Invariant cache hit.
[2024-05-24 12:48:43] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 12:48:43] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
[2024-05-24 12:48:43] [INFO ] Invariant cache hit.
[2024-05-24 12:48:43] [INFO ] State equation strengthened by 449 read => feed constraints.
[2024-05-24 12:48:44] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2024-05-24 12:48:46] [INFO ] Redundant transitions in 1606 ms returned []
Running 1729 sub problems to find dead transitions.
[2024-05-24 12:48:46] [INFO ] Flow matrix only has 525 transitions (discarded 1206 similar events)
[2024-05-24 12:48:46] [INFO ] Invariant cache hit.
[2024-05-24 12:48:46] [INFO ] State equation strengthened by 449 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1729 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1729 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1729 unsolved
[2024-05-24 12:49:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 12:49:36] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 1 ms to minimize.
[2024-05-24 12:49:36] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2024-05-24 12:49:37] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2024-05-24 12:49:37] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1611 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 5/21 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 87/612 variables, and 21 constraints, problems are : Problem set: 96 solved, 1633 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/87 constraints, ReadFeed: 0/449 constraints, PredecessorRefiner: 1729/1729 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 96 solved, 1633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/16 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 5/21 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
At refinement iteration 5 (OVERLAPS) 525/612 variables, 87/108 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 449/557 constraints. Problems are: Problem set: 96 solved, 1633 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/612 variables, and 2190 constraints, problems are : Problem set: 96 solved, 1633 unsolved in 42520 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 449/449 constraints, PredecessorRefiner: 1633/1729 constraints, Known Traps: 5/5 constraints]
After SMT, in 110534ms problems are : Problem set: 96 solved, 1633 unsolved
Search for dead transitions found 96 dead transitions in 110593ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/87 places, 1635/1731 transitions.
Applied a total of 0 rules in 335 ms. Remains 87 /87 variables (removed 0) and now considering 1635/1635 (removed 0) transitions.
[2024-05-24 12:50:37] [INFO ] Redundant transitions in 715 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 114594 ms. Remains : 87/87 places, 1635/1731 transitions.
RANDOM walk for 40000 steps (8 resets) in 1607 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 147380 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 147380 steps, saw 75289 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 12:50:41] [INFO ] Flow matrix only has 501 transitions (discarded 1134 similar events)
// Phase 1: matrix 501 rows 87 cols
[2024-05-24 12:50:41] [INFO ] Computed 16 invariants in 4 ms
[2024-05-24 12:50:41] [INFO ] State equation strengthened by 425 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/83 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/84 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 500/584 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 424/524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/588 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/588 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 528 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 425/425 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/83 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 12:50:43] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/84 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 500/584 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 424/525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/588 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 6/535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/588 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 588/588 variables, and 535 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5955 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 425/425 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 7324ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5166 ms.
Support contains 40 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1635/1635 transitions.
Applied a total of 0 rules in 359 ms. Remains 87 /87 variables (removed 0) and now considering 1635/1635 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 87/87 places, 1635/1635 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1635/1635 transitions.
Applied a total of 0 rules in 320 ms. Remains 87 /87 variables (removed 0) and now considering 1635/1635 (removed 0) transitions.
[2024-05-24 12:50:54] [INFO ] Flow matrix only has 501 transitions (discarded 1134 similar events)
[2024-05-24 12:50:54] [INFO ] Invariant cache hit.
[2024-05-24 12:50:55] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-24 12:50:55] [INFO ] Flow matrix only has 501 transitions (discarded 1134 similar events)
[2024-05-24 12:50:55] [INFO ] Invariant cache hit.
[2024-05-24 12:50:55] [INFO ] State equation strengthened by 425 read => feed constraints.
[2024-05-24 12:50:55] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-24 12:50:57] [INFO ] Redundant transitions in 1664 ms returned []
Running 1633 sub problems to find dead transitions.
[2024-05-24 12:50:57] [INFO ] Flow matrix only has 501 transitions (discarded 1134 similar events)
[2024-05-24 12:50:57] [INFO ] Invariant cache hit.
[2024-05-24 12:50:57] [INFO ] State equation strengthened by 425 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EnergyBus-PT-none

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 157
TRANSITIONS: 4430
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 63389
NUPN UNITS: 29
LOADING TIME: 1.859

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.249
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 3.543
OK.
----------------------------------------------------------------------
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: 712
MODEL NAME: /home/mcc/execution/model
157 places, 4430 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-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EnergyBus-PT-none-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716555421913

--------------------
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 ReachabilityFireability -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="ReachabilityFireability"
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 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 r157-smll-171636265300223"
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 [ "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 ;