Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266400220.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 itstools
Input is EnergyBus-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266400220
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1716579167019

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 19:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:32:50] [INFO ] Load time of PNML (sax parser for PT used): 790 ms
[2024-05-24 19:32:50] [INFO ] Transformed 157 places.
[2024-05-24 19:32:50] [INFO ] Transformed 4430 transitions.
[2024-05-24 19:32:50] [INFO ] Found NUPN structural information;
[2024-05-24 19:32:50] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 1032 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 32 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-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 130 transition count 1808
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 130 transition count 1808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 130 transition count 1805
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 130 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 129 transition count 1796
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 129 transition count 1796
Applied a total of 59 rules in 173 ms. Remains 129 /153 variables (removed 24) and now considering 1796/1913 (removed 117) transitions.
[2024-05-24 19:32:51] [INFO ] Flow matrix only has 586 transitions (discarded 1210 similar events)
// Phase 1: matrix 586 rows 129 cols
[2024-05-24 19:32:51] [INFO ] Computed 23 invariants in 52 ms
[2024-05-24 19:32:51] [INFO ] Implicit Places using invariants in 545 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/153 places, 1796/1913 transitions.
Applied a total of 0 rules in 20 ms. Remains 128 /128 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 846 ms. Remains : 128/153 places, 1796/1913 transitions.
Support contains 32 out of 128 places after structural reductions.
[2024-05-24 19:32:52] [INFO ] Flatten gal took : 445 ms
[2024-05-24 19:32:52] [INFO ] Flatten gal took : 256 ms
[2024-05-24 19:32:53] [INFO ] Input system was already deterministic with 1796 transitions.
RANDOM walk for 40000 steps (8 resets) in 3726 ms. (10 steps per ms) remains 21/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
[2024-05-24 19:32:54] [INFO ] Flow matrix only has 586 transitions (discarded 1210 similar events)
// Phase 1: matrix 586 rows 128 cols
[2024-05-24 19:32:54] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 19:32:54] [INFO ] State equation strengthened by 445 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 49/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 37/115 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 19:32:56] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 10/125 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 583/708 variables, 125/148 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 444/592 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/708 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 5/713 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 1/714 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 714/714 variables, and 596 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 49/78 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 37/115 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 10/125 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 583/708 variables, 125/148 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/708 variables, 444/592 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/708 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 5/713 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 21/616 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/714 variables, and 616 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 444/445 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints]
After SMT, in 11164ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 59 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 722 edges and 122 vertex of which 119 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.47 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 119 transition count 1767
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 115 transition count 1767
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 115 transition count 1763
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 111 transition count 1763
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 15 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 102 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 102 transition count 1752
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 97 transition count 1761
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 58 place count 97 transition count 1753
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 137 place count 97 transition count 1674
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 95 transition count 1672
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 144 place count 93 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 145 place count 92 transition count 1671
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 145 place count 92 transition count 1669
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 149 place count 90 transition count 1669
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 7 with 2 rules applied. Total rules applied 151 place count 89 transition count 1668
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 156 place count 89 transition count 1663
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 162 place count 84 transition count 1662
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 163 place count 84 transition count 1661
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 164 place count 84 transition count 1723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 165 place count 83 transition count 1723
Applied a total of 165 rules in 2257 ms. Remains 83 /128 variables (removed 45) and now considering 1723/1796 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2258 ms. Remains : 83/128 places, 1723/1796 transitions.
RANDOM walk for 40000 steps (8 resets) in 1373 ms. (29 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 109906 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :1 out of 20
Probabilistic random walk after 109906 steps, saw 62037 distinct states, run finished after 3008 ms. (steps per millisecond=36 ) properties seen :1
[2024-05-24 19:33:11] [INFO ] Flow matrix only has 516 transitions (discarded 1207 similar events)
// Phase 1: matrix 516 rows 83 cols
[2024-05-24 19:33:11] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 19:33:11] [INFO ] State equation strengthened by 456 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 25/80 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 19:33:12] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 515/596 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 455/556 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 3/599 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/599 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 559 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4628 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 25/80 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 515/596 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 455/556 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 3/599 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 19/578 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/599 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 578 constraints, problems are : Problem set: 0 solved, 19 unsolved in 13910 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
After SMT, in 19056ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 2 properties in 3310 ms.
Support contains 28 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1723/1723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 83 transition count 1722
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 82 transition count 1722
Applied a total of 2 rules in 294 ms. Remains 82 /83 variables (removed 1) and now considering 1722/1723 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 82/83 places, 1722/1723 transitions.
RANDOM walk for 40000 steps (8 resets) in 1738 ms. (23 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 111074 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 17
Probabilistic random walk after 111074 steps, saw 64533 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-24 19:33:38] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
// Phase 1: matrix 515 rows 82 cols
[2024-05-24 19:33:38] [INFO ] Computed 19 invariants in 10 ms
[2024-05-24 19:33:38] [INFO ] State equation strengthened by 456 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 25/79 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 19:33:39] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 514/594 variables, 80/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 455/555 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/597 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/597 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 558 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 25/79 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 514/594 variables, 80/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 455/555 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/597 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 17/575 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 19:33:47] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/597 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 576 constraints, problems are : Problem set: 0 solved, 17 unsolved in 10454 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 456/456 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 14387ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 1911 ms.
Support contains 28 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 338 ms. Remains 82 /82 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 82/82 places, 1722/1722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 327 ms. Remains 82 /82 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-05-24 19:33:55] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:33:55] [INFO ] Invariant cache hit.
[2024-05-24 19:33:55] [INFO ] Implicit Places using invariants in 102 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/82 places, 1722/1722 transitions.
Applied a total of 0 rules in 277 ms. Remains 81 /81 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 709 ms. Remains : 81/82 places, 1722/1722 transitions.
RANDOM walk for 40000 steps (8 resets) in 1576 ms. (25 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 144357 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 17
Probabilistic random walk after 144357 steps, saw 82775 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-24 19:33:59] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
// Phase 1: matrix 515 rows 81 cols
[2024-05-24 19:33:59] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 19:33:59] [INFO ] State equation strengthened by 448 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/79 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 514/593 variables, 79/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 447/544 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 3/596 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/596 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 547 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3694 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 19:34:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/79 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 514/593 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 447/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/596 variables, 2/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/596 variables, 17/565 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 19:34:08] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/596 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/596 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/596 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 596/596 variables, and 566 constraints, problems are : Problem set: 0 solved, 17 unsolved in 12601 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 16628ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1455 ms.
Support contains 28 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 1722/1722 transitions.
Applied a total of 0 rules in 280 ms. Remains 81 /81 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 81/81 places, 1722/1722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 1722/1722 transitions.
Applied a total of 0 rules in 279 ms. Remains 81 /81 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-05-24 19:34:17] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:34:17] [INFO ] Invariant cache hit.
[2024-05-24 19:34:17] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 19:34:17] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:34:17] [INFO ] Invariant cache hit.
[2024-05-24 19:34:18] [INFO ] State equation strengthened by 448 read => feed constraints.
[2024-05-24 19:34:18] [INFO ] Implicit Places using invariants and state equation in 939 ms returned [13, 60]
[2024-05-24 19:34:18] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1044 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 80/81 places, 1722/1722 transitions.
Applied a total of 0 rules in 447 ms. Remains 80 /80 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1772 ms. Remains : 80/81 places, 1722/1722 transitions.
RANDOM walk for 40000 steps (8 resets) in 1566 ms. (25 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 115744 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 17
Probabilistic random walk after 115744 steps, saw 67466 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-24 19:34:22] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
// Phase 1: matrix 515 rows 80 cols
[2024-05-24 19:34:22] [INFO ] Computed 17 invariants in 6 ms
[2024-05-24 19:34:22] [INFO ] State equation strengthened by 448 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 22/76 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 19:34:23] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 514/591 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 447/542 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 4/595 variables, 3/545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/595 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/595 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 546 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3594 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 22/76 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 19:34:27] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 514/591 variables, 77/96 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 447/543 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 4/595 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/595 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/595 variables, 17/564 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/595 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/595 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 564 constraints, problems are : Problem set: 0 solved, 17 unsolved in 10203 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 14157ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 5228 ms.
Support contains 28 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 1722/1722 transitions.
Applied a total of 0 rules in 279 ms. Remains 80 /80 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 80/80 places, 1722/1722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 1722/1722 transitions.
Applied a total of 0 rules in 279 ms. Remains 80 /80 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
[2024-05-24 19:34:42] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:34:42] [INFO ] Invariant cache hit.
[2024-05-24 19:34:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 19:34:42] [INFO ] Flow matrix only has 515 transitions (discarded 1207 similar events)
[2024-05-24 19:34:42] [INFO ] Invariant cache hit.
[2024-05-24 19:34:42] [INFO ] State equation strengthened by 448 read => feed constraints.
[2024-05-24 19:34:43] [INFO ] Implicit Places using invariants and state equation in 720 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 823 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 79/80 places, 1722/1722 transitions.
Applied a total of 0 rules in 321 ms. Remains 79 /79 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1423 ms. Remains : 79/80 places, 1722/1722 transitions.
Computed a total of 3 stabilizing places and 130 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 84 edges and 128 vertex of which 12 / 128 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 425 transitions
Reduce isomorphic transitions removed 425 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 121 transition count 1367
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 117 transition count 1367
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 117 transition count 1362
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 112 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 106 transition count 858
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 106 transition count 858
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 97 transition count 849
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 97 transition count 847
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 92 transition count 855
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 65 place count 92 transition count 851
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 79 place count 92 transition count 837
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 92 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 91 transition count 836
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 89 place count 87 transition count 832
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 87 transition count 831
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 86 transition count 831
Applied a total of 91 rules in 731 ms. Remains 86 /128 variables (removed 42) and now considering 831/1796 (removed 965) transitions.
[2024-05-24 19:34:44] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 86 cols
[2024-05-24 19:34:44] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 19:34:44] [INFO ] Implicit Places using invariants in 169 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/128 places, 831/1796 transitions.
Applied a total of 0 rules in 132 ms. Remains 85 /85 variables (removed 0) and now considering 831/831 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1036 ms. Remains : 85/128 places, 831/1796 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 986 ms.
Product exploration explored 100000 steps with 0 reset in 821 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512022 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512022 steps, saw 204676 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-24 19:34:50] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 85 cols
[2024-05-24 19:34:50] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 19:34:50] [INFO ] State equation strengthened by 186 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/74 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/80 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 256/336 variables, 80/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 99/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/347 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 86/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/348 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/348 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/74 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:34:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 256/336 variables, 80/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 99/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/347 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 86/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/348 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/348 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 969ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 ms.
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 831/831 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 85 transition count 821
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 10 place count 85 transition count 816
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 22 place count 78 transition count 816
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 1 with 1 rules applied. Total rules applied 23 place count 78 transition count 815
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 77 transition count 814
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 77 transition count 813
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 75 transition count 813
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 78 place count 75 transition count 763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 75 transition count 762
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 74 transition count 762
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 91 place count 74 transition count 751
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 103 place count 63 transition count 750
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 4 with 73 rules applied. Total rules applied 176 place count 63 transition count 677
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 63 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 62 transition count 723
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 182 place count 62 transition count 723
Applied a total of 182 rules in 574 ms. Remains 62 /85 variables (removed 23) and now considering 723/831 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 575 ms. Remains : 62/85 places, 723/831 transitions.
RANDOM walk for 40000 steps (8 resets) in 486 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 620687 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 620687 steps, saw 257089 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-24 19:34:55] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
// Phase 1: matrix 162 rows 62 cols
[2024-05-24 19:34:55] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 19:34:55] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/58 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/216 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 63/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/224 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 49/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/58 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/216 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 63/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/224 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 49/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/224 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 178 ms.
Support contains 8 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 723/723 transitions.
Applied a total of 0 rules in 88 ms. Remains 62 /62 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 62/62 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 723/723 transitions.
Applied a total of 0 rules in 85 ms. Remains 62 /62 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-05-24 19:34:56] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
[2024-05-24 19:34:56] [INFO ] Invariant cache hit.
[2024-05-24 19:34:56] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-24 19:34:56] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
[2024-05-24 19:34:56] [INFO ] Invariant cache hit.
[2024-05-24 19:34:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:34:56] [INFO ] Implicit Places using invariants and state equation in 411 ms returned [13, 48]
[2024-05-24 19:34:56] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 604 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/62 places, 723/723 transitions.
Applied a total of 0 rules in 83 ms. Remains 61 /61 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 773 ms. Remains : 61/62 places, 723/723 transitions.
RANDOM walk for 40000 steps (8 resets) in 698 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 659654 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 659654 steps, saw 272513 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2024-05-24 19:35:00] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
// Phase 1: matrix 162 rows 61 cols
[2024-05-24 19:35:00] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 19:35:00] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/56 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/214 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 63/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/223 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 49/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 61/61 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/56 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/214 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 63/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/223 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 49/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 61/61 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 723/723 transitions.
Applied a total of 0 rules in 84 ms. Remains 61 /61 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 61/61 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 723/723 transitions.
Applied a total of 0 rules in 84 ms. Remains 61 /61 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2024-05-24 19:35:00] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
[2024-05-24 19:35:00] [INFO ] Invariant cache hit.
[2024-05-24 19:35:01] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-24 19:35:01] [INFO ] Flow matrix only has 162 transitions (discarded 561 similar events)
[2024-05-24 19:35:01] [INFO ] Invariant cache hit.
[2024-05-24 19:35:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:35:01] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 511 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/61 places, 723/723 transitions.
Graph (complete) has 390 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 59 transition count 718
Applied a total of 6 rules in 87 ms. Remains 59 /60 variables (removed 1) and now considering 718/723 (removed 5) transitions.
[2024-05-24 19:35:01] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
// Phase 1: matrix 161 rows 59 cols
[2024-05-24 19:35:01] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:35:01] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 19:35:01] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:35:01] [INFO ] Invariant cache hit.
[2024-05-24 19:35:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:35:01] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 718/723 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1023 ms. Remains : 59/61 places, 718/723 transitions.
RANDOM walk for 40000 steps (8 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 663243 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 1
Probabilistic random walk after 663243 steps, saw 273844 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
[2024-05-24 19:35:05] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:35:05] [INFO ] Invariant cache hit.
[2024-05-24 19:35:05] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 157/211 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 62/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/220 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 49/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/220 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 157/211 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 62/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/220 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 49/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:35:05] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 718/718 transitions.
Applied a total of 0 rules in 88 ms. Remains 59 /59 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 59/59 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 718/718 transitions.
Applied a total of 0 rules in 84 ms. Remains 59 /59 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2024-05-24 19:35:05] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:35:05] [INFO ] Invariant cache hit.
[2024-05-24 19:35:05] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-24 19:35:05] [INFO ] Flow matrix only has 161 transitions (discarded 557 similar events)
[2024-05-24 19:35:05] [INFO ] Invariant cache hit.
[2024-05-24 19:35:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-24 19:35:06] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-05-24 19:35:06] [INFO ] Redundant transitions in 117 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 715 sub problems to find dead transitions.
[2024-05-24 19:35:06] [INFO ] Flow matrix only has 160 transitions (discarded 557 similar events)
// Phase 1: matrix 160 rows 59 cols
[2024-05-24 19:35:06] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:35:06] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-24 19:35:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 19:35:16] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-24 19:35:16] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 160/219 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 111/188 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 715 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 188 constraints, problems are : Problem set: 0 solved, 715 unsolved in 26023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 160/219 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 111/188 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 715/903 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/219 variables, and 903 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 3/3 constraints]
After SMT, in 61011ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 61031ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/59 places, 717/718 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 716
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 58 transition count 715
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 57 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 57 transition count 712
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 57 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 56 transition count 711
Applied a total of 8 rules in 293 ms. Remains 56 /59 variables (removed 3) and now considering 711/717 (removed 6) transitions.
[2024-05-24 19:36:07] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
// Phase 1: matrix 154 rows 56 cols
[2024-05-24 19:36:07] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 19:36:07] [INFO ] Implicit Places using invariants in 175 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/59 places, 711/718 transitions.
Applied a total of 0 rules in 100 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62390 ms. Remains : 55/59 places, 711/718 transitions.
RANDOM walk for 40000 steps (8 resets) in 630 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 656304 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 656304 steps, saw 219503 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
[2024-05-24 19:36:11] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
// Phase 1: matrix 154 rows 55 cols
[2024-05-24 19:36:11] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 19:36:11] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/50 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/199 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 59/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/209 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/50 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/199 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 59/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/209 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 50/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 200 ms.
Support contains 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 711/711 transitions.
Applied a total of 0 rules in 102 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 55/55 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 711/711 transitions.
Applied a total of 0 rules in 102 ms. Remains 55 /55 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2024-05-24 19:36:12] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:36:12] [INFO ] Invariant cache hit.
[2024-05-24 19:36:12] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 19:36:12] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:36:12] [INFO ] Invariant cache hit.
[2024-05-24 19:36:12] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-24 19:36:12] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-24 19:36:12] [INFO ] Redundant transitions in 53 ms returned []
Running 709 sub problems to find dead transitions.
[2024-05-24 19:36:12] [INFO ] Flow matrix only has 154 transitions (discarded 557 similar events)
[2024-05-24 19:36:12] [INFO ] Invariant cache hit.
[2024-05-24 19:36:12] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-05-24 19:36:23] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 4 (OVERLAPS) 154/209 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 109/179 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/209 variables, and 179 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 4 (OVERLAPS) 154/209 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 109/179 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 709/888 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 209/209 variables, and 888 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 1/1 constraints]
After SMT, in 65736ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 65756ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66462 ms. Remains : 55/55 places, 711/711 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 831/831 transitions.
Applied a total of 0 rules in 128 ms. Remains 85 /85 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-24 19:37:18] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 85 cols
[2024-05-24 19:37:18] [INFO ] Computed 20 invariants in 3 ms
[2024-05-24 19:37:19] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-24 19:37:19] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
[2024-05-24 19:37:19] [INFO ] Invariant cache hit.
[2024-05-24 19:37:19] [INFO ] State equation strengthened by 186 read => feed constraints.
[2024-05-24 19:37:19] [INFO ] Implicit Places using invariants and state equation in 596 ms returned [13, 64]
[2024-05-24 19:37:19] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 867 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 831/831 transitions.
Applied a total of 0 rules in 78 ms. Remains 84 /84 variables (removed 0) and now considering 831/831 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1075 ms. Remains : 84/85 places, 831/831 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 489 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 633850 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 633850 steps, saw 250580 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2024-05-24 19:37:23] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
// Phase 1: matrix 263 rows 84 cols
[2024-05-24 19:37:23] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 19:37:23] [INFO ] State equation strengthened by 186 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/72 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/78 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 256/334 variables, 78/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 99/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/346 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 86/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/347 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/347 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 289 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/72 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:37:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-24 19:37:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/78 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 256/334 variables, 78/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 99/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/346 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 86/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:37:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/347 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/347 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 278 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 735 ms.
Product exploration explored 100000 steps with 0 reset in 762 ms.
Built C files in :
/tmp/ltsmin18092827194543843232
[2024-05-24 19:37:25] [INFO ] Computing symmetric may disable matrix : 831 transitions.
[2024-05-24 19:37:25] [INFO ] Computation of Complete disable matrix. took 88 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:37:25] [INFO ] Computing symmetric may enable matrix : 831 transitions.
[2024-05-24 19:37:25] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:37:26] [INFO ] Computing Do-Not-Accords matrix : 831 transitions.
[2024-05-24 19:37:26] [INFO ] Computation of Completed DNA matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:37:26] [INFO ] Built C files in 460ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18092827194543843232
Running compilation step : cd /tmp/ltsmin18092827194543843232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18092827194543843232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18092827194543843232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 831/831 transitions.
Applied a total of 0 rules in 77 ms. Remains 84 /84 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-24 19:37:29] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
[2024-05-24 19:37:29] [INFO ] Invariant cache hit.
[2024-05-24 19:37:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-24 19:37:29] [INFO ] Flow matrix only has 263 transitions (discarded 568 similar events)
[2024-05-24 19:37:29] [INFO ] Invariant cache hit.
[2024-05-24 19:37:29] [INFO ] State equation strengthened by 186 read => feed constraints.
[2024-05-24 19:37:29] [INFO ] Implicit Places using invariants and state equation in 486 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 636 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/84 places, 831/831 transitions.
Applied a total of 0 rules in 123 ms. Remains 83 /83 variables (removed 0) and now considering 831/831 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 836 ms. Remains : 83/84 places, 831/831 transitions.
Built C files in :
/tmp/ltsmin251608893741731054
[2024-05-24 19:37:30] [INFO ] Computing symmetric may disable matrix : 831 transitions.
[2024-05-24 19:37:30] [INFO ] Computation of Complete disable matrix. took 109 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:37:30] [INFO ] Computing symmetric may enable matrix : 831 transitions.
[2024-05-24 19:37:30] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:37:30] [INFO ] Computing Do-Not-Accords matrix : 831 transitions.
[2024-05-24 19:37:30] [INFO ] Computation of Completed DNA matrix. took 86 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:37:30] [INFO ] Built C files in 588ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin251608893741731054
Running compilation step : cd /tmp/ltsmin251608893741731054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin251608893741731054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin251608893741731054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:37:34] [INFO ] Flatten gal took : 127 ms
[2024-05-24 19:37:34] [INFO ] Flatten gal took : 128 ms
[2024-05-24 19:37:34] [INFO ] Time to serialize gal into /tmp/LTL8365264831293442562.gal : 50 ms
[2024-05-24 19:37:34] [INFO ] Time to serialize properties into /tmp/LTL10784487747807443362.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8365264831293442562.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14182726849101957199.hoa' '-atoms' '/tmp/LTL10784487747807443362.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10784487747807443362.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14182726849101957199.hoa
Reverse transition relation is NOT exact ! Due to transitions t52, t53, t68, t69, t70, t72, t95, t117, t1750, t1759, t1760, t1768, t1771, t1786.t76, t1789....410
Detected timeout of ITS tools.
[2024-05-24 19:37:49] [INFO ] Flatten gal took : 88 ms
[2024-05-24 19:37:49] [INFO ] Flatten gal took : 90 ms
[2024-05-24 19:37:49] [INFO ] Time to serialize gal into /tmp/LTL9885833870431298878.gal : 23 ms
[2024-05-24 19:37:49] [INFO ] Time to serialize properties into /tmp/LTL14237102799627873232.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9885833870431298878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14237102799627873232.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p16==0)||(p19==0))||((p41==0)||(p58==0)))||(((p86==0)||(p108==0))||((p113==0)||(p140==0))))"))))
Formula 0 simplified : GF!"((((p16==0)||(p19==0))||((p41==0)||(p58==0)))||(((p86==0)||(p108==0))||((p113==0)||(p140==0))))"
Reverse transition relation is NOT exact ! Due to transitions t52, t53, t68, t69, t70, t72, t95, t117, t1750, t1759, t1760, t1768, t1771, t1786.t76, t1789....410
Detected timeout of ITS tools.
[2024-05-24 19:38:04] [INFO ] Flatten gal took : 62 ms
[2024-05-24 19:38:04] [INFO ] Applying decomposition
[2024-05-24 19:38:05] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16533907697610241969.txt' '-o' '/tmp/graph16533907697610241969.bin' '-w' '/tmp/graph16533907697610241969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16533907697610241969.bin' '-l' '-1' '-v' '-w' '/tmp/graph16533907697610241969.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:38:05] [INFO ] Decomposing Gal with order
[2024-05-24 19:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:38:05] [INFO ] Removed a total of 4463 redundant transitions.
[2024-05-24 19:38:05] [INFO ] Flatten gal took : 276 ms
[2024-05-24 19:38:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 67 ms.
[2024-05-24 19:38:06] [INFO ] Time to serialize gal into /tmp/LTL632380659324432042.gal : 12 ms
[2024-05-24 19:38:06] [INFO ] Time to serialize properties into /tmp/LTL15314990332173507392.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL632380659324432042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15314990332173507392.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i3.u2.p16==0)||(i1.u9.p19==0))||((i1.u6.p41==0)||(i1.u9.p58==0)))||(((i7.u18.p86==0)||(i0.u20.p108==0))||((i3.u2.p113==0)|...180
Formula 0 simplified : GF!"((((i3.u2.p16==0)||(i1.u9.p19==0))||((i1.u6.p41==0)||(i1.u9.p58==0)))||(((i7.u18.p86==0)||(i0.u20.p108==0))||((i3.u2.p113==0)||(...174
Reverse transition relation is NOT exact ! Due to transitions t69, t72, t117, t1750, t1771, t108_t54_t58, t108_t55, t1776_t14, i1.u9.t95, i3.u2.t52, i3.u2....518
Detected timeout of ITS tools.
Treatment of property EnergyBus-PT-none-LTLFireability-00 finished in 217131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 16 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 71 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 118 transition count 1775
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 113 transition count 1775
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 109 transition count 1359
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 109 transition count 1359
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 100 transition count 1350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1348
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1356
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 82 place count 94 transition count 1337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 94 transition count 1336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 93 transition count 1336
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 92 place count 89 transition count 1332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 89 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 88 transition count 1331
Applied a total of 94 rules in 937 ms. Remains 88 /128 variables (removed 40) and now considering 1331/1796 (removed 465) transitions.
[2024-05-24 19:38:22] [INFO ] Flow matrix only has 311 transitions (discarded 1020 similar events)
// Phase 1: matrix 311 rows 88 cols
[2024-05-24 19:38:22] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 19:38:22] [INFO ] Implicit Places using invariants in 162 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/128 places, 1331/1796 transitions.
Applied a total of 0 rules in 209 ms. Remains 87 /87 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1315 ms. Remains : 87/128 places, 1331/1796 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-01 finished in 1465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&((!p2||F(!p1)) U (!p1||G((!p2||F(!p1)))))))))'
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 1316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 1316
Applied a total of 8 rules in 13 ms. Remains 124 /128 variables (removed 4) and now considering 1316/1796 (removed 480) transitions.
[2024-05-24 19:38:22] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 124 cols
[2024-05-24 19:38:22] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:38:22] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-24 19:38:22] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
[2024-05-24 19:38:22] [INFO ] Invariant cache hit.
[2024-05-24 19:38:22] [INFO ] State equation strengthened by 325 read => feed constraints.
[2024-05-24 19:38:23] [INFO ] Implicit Places using invariants and state equation in 723 ms returned [20, 96]
[2024-05-24 19:38:23] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 893 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1316/1796 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 915 ms. Remains : 123/128 places, 1316/1796 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), true, p1, (AND p1 p2)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 11127 reset in 3463 ms.
Product exploration explored 100000 steps with 11246 reset in 3450 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p1), (X (AND p1 (NOT p2))), (X p0), (X (NOT (AND p1 p2))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 29 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 524 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
RANDOM walk for 40000 steps (8 resets) in 1177 ms. (33 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
[2024-05-24 19:38:32] [INFO ] Flow matrix only has 466 transitions (discarded 850 similar events)
// Phase 1: matrix 466 rows 123 cols
[2024-05-24 19:38:32] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 19:38:32] [INFO ] State equation strengthened by 325 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/71 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/106 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 5 (OVERLAPS) 10/116 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 461/577 variables, 116/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 169/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/588 variables, 7/313 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 155/468 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/589 variables, 1/469 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/589 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/589 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 469 constraints, problems are : Problem set: 1 solved, 2 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 325/325 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/71 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/106 variables, 11/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/116 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 461/577 variables, 116/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 169/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/588 variables, 7/313 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 155/468 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 2/470 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/589 variables, 1/471 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/589 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/589 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 471 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 325/325 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2308ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 770 ms.
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1316/1316 transitions.
Graph (trivial) has 81 edges and 123 vertex of which 10 / 123 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 673 edges and 117 vertex of which 114 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 114 transition count 1287
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 110 transition count 1287
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 110 transition count 1281
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 104 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 103 transition count 1201
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 103 transition count 1201
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 94 transition count 1192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 94 transition count 1190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 88 transition count 1202
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 67 place count 88 transition count 1193
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 4 with 84 rules applied. Total rules applied 151 place count 88 transition count 1109
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 155 place count 86 transition count 1107
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 84 transition count 1105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 82 transition count 1105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 161 place count 82 transition count 1104
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 163 place count 81 transition count 1104
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 169 place count 78 transition count 1101
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 178 place count 78 transition count 1092
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 187 place count 69 transition count 1092
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 188 place count 69 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 189 place count 68 transition count 1154
Applied a total of 189 rules in 926 ms. Remains 68 /123 variables (removed 55) and now considering 1154/1316 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 928 ms. Remains : 68/123 places, 1154/1316 transitions.
RANDOM walk for 40000 steps (8 resets) in 1659 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 188947 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188947 steps, saw 59361 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-24 19:38:39] [INFO ] Flow matrix only has 262 transitions (discarded 892 similar events)
// Phase 1: matrix 262 rows 68 cols
[2024-05-24 19:38:39] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 19:38:39] [INFO ] State equation strengthened by 213 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/61 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 258/320 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 210/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/330 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/61 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:38:40] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-24 19:38:40] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 258/320 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 210/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/330 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/330 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 213/213 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1478ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 749 ms.
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1154/1154 transitions.
Applied a total of 0 rules in 207 ms. Remains 68 /68 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 68/68 places, 1154/1154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1154/1154 transitions.
Applied a total of 0 rules in 201 ms. Remains 68 /68 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
[2024-05-24 19:38:42] [INFO ] Flow matrix only has 262 transitions (discarded 892 similar events)
[2024-05-24 19:38:42] [INFO ] Invariant cache hit.
[2024-05-24 19:38:43] [INFO ] Implicit Places using invariants in 881 ms returned [28, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 885 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/68 places, 1154/1154 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 128 place count 66 transition count 1026
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 66 transition count 1024
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 132 place count 64 transition count 1024
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 64 transition count 1024
Applied a total of 138 rules in 648 ms. Remains 64 /66 variables (removed 2) and now considering 1024/1154 (removed 130) transitions.
[2024-05-24 19:38:43] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
// Phase 1: matrix 228 rows 64 cols
[2024-05-24 19:38:43] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 19:38:44] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-24 19:38:44] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:38:44] [INFO ] Invariant cache hit.
[2024-05-24 19:38:44] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-24 19:38:44] [INFO ] Implicit Places using invariants and state equation in 463 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 625 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/68 places, 1024/1154 transitions.
Applied a total of 0 rules in 166 ms. Remains 63 /63 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2534 ms. Remains : 63/68 places, 1024/1154 transitions.
RANDOM walk for 40000 steps (8 resets) in 1954 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 284835 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 284835 steps, saw 61543 distinct states, run finished after 3004 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-24 19:38:48] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
// Phase 1: matrix 228 rows 63 cols
[2024-05-24 19:38:48] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:38:48] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/56 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 222/278 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 92/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/291 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 81/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/56 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:38:48] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 222/278 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/291 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 81/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/291 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1059ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 510 ms.
Support contains 9 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1024/1024 transitions.
Applied a total of 0 rules in 165 ms. Remains 63 /63 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 63/63 places, 1024/1024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 1024/1024 transitions.
Applied a total of 0 rules in 128 ms. Remains 63 /63 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
[2024-05-24 19:38:50] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:38:50] [INFO ] Invariant cache hit.
[2024-05-24 19:38:50] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-24 19:38:50] [INFO ] Flow matrix only has 228 transitions (discarded 796 similar events)
[2024-05-24 19:38:50] [INFO ] Invariant cache hit.
[2024-05-24 19:38:50] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-05-24 19:38:50] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-24 19:38:50] [INFO ] Redundant transitions in 422 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1021 sub problems to find dead transitions.
[2024-05-24 19:38:51] [INFO ] Flow matrix only has 227 transitions (discarded 796 similar events)
// Phase 1: matrix 227 rows 63 cols
[2024-05-24 19:38:51] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:38:51] [INFO ] State equation strengthened by 173 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
[2024-05-24 19:39:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 19:39:11] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2024-05-24 19:39:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 4 (OVERLAPS) 227/290 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 173/254 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/290 variables, and 254 constraints, problems are : Problem set: 0 solved, 1021 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 1021/1021 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1021 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 4 (OVERLAPS) 227/290 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 173/254 constraints. Problems are: Problem set: 0 solved, 1021 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 1275 constraints, problems are : Problem set: 0 solved, 1021 unsolved in 32427 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 173/173 constraints, PredecessorRefiner: 1021/1021 constraints, Known Traps: 3/3 constraints]
After SMT, in 74230ms problems are : Problem set: 0 solved, 1021 unsolved
Search for dead transitions found 0 dead transitions in 74253ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/63 places, 1023/1024 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 62 transition count 1022
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 1021
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 1020
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 61 transition count 1018
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 61 transition count 1018
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 61 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 1017
Applied a total of 8 rules in 328 ms. Remains 60 /63 variables (removed 3) and now considering 1017/1023 (removed 6) transitions.
[2024-05-24 19:40:05] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
// Phase 1: matrix 221 rows 60 cols
[2024-05-24 19:40:05] [INFO ] Computed 15 invariants in 1 ms
[2024-05-24 19:40:05] [INFO ] Implicit Places using invariants in 107 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/63 places, 1017/1024 transitions.
Applied a total of 0 rules in 100 ms. Remains 59 /59 variables (removed 0) and now considering 1017/1017 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 75774 ms. Remains : 59/63 places, 1017/1024 transitions.
RANDOM walk for 40000 steps (8 resets) in 1377 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 264083 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 264083 steps, saw 47012 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-24 19:40:09] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
// Phase 1: matrix 221 rows 59 cols
[2024-05-24 19:40:09] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 19:40:09] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/52 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 214/266 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 89/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/280 variables, 7/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 82/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/52 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 214/266 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 89/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/280 variables, 7/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 82/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1021ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 486 ms.
Support contains 9 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1017/1017 transitions.
Applied a total of 0 rules in 166 ms. Remains 59 /59 variables (removed 0) and now considering 1017/1017 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 59/59 places, 1017/1017 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1017/1017 transitions.
Applied a total of 0 rules in 163 ms. Remains 59 /59 variables (removed 0) and now considering 1017/1017 (removed 0) transitions.
[2024-05-24 19:40:11] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
[2024-05-24 19:40:11] [INFO ] Invariant cache hit.
[2024-05-24 19:40:11] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-24 19:40:11] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
[2024-05-24 19:40:11] [INFO ] Invariant cache hit.
[2024-05-24 19:40:11] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-05-24 19:40:11] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-24 19:40:11] [INFO ] Redundant transitions in 52 ms returned []
Running 1015 sub problems to find dead transitions.
[2024-05-24 19:40:11] [INFO ] Flow matrix only has 221 transitions (discarded 796 similar events)
[2024-05-24 19:40:11] [INFO ] Invariant cache hit.
[2024-05-24 19:40:11] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
[2024-05-24 19:40:31] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 4 (OVERLAPS) 221/280 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 171/245 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 280/280 variables, and 245 constraints, problems are : Problem set: 0 solved, 1015 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1015/1015 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1015 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 4 (OVERLAPS) 221/280 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 171/245 constraints. Problems are: Problem set: 0 solved, 1015 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 1260 constraints, problems are : Problem set: 0 solved, 1015 unsolved in 31956 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 1015/1015 constraints, Known Traps: 1/1 constraints]
After SMT, in 72986ms problems are : Problem set: 0 solved, 1015 unsolved
Search for dead transitions found 0 dead transitions in 73010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73837 ms. Remains : 59/59 places, 1017/1017 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p1), (X (AND p1 (NOT p2))), (X p0), (X (NOT (AND p1 p2))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 9 states, 29 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EnergyBus-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EnergyBus-PT-none-LTLFireability-02 finished in 182340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(X(p0)))||X(p1)) U X((X(X(G(p0))) U p1))))'
Support contains 11 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 1364
Applied a total of 8 rules in 11 ms. Remains 124 /128 variables (removed 4) and now considering 1364/1796 (removed 432) transitions.
[2024-05-24 19:41:24] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
// Phase 1: matrix 478 rows 124 cols
[2024-05-24 19:41:24] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:41:25] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-24 19:41:25] [INFO ] Flow matrix only has 478 transitions (discarded 886 similar events)
[2024-05-24 19:41:25] [INFO ] Invariant cache hit.
[2024-05-24 19:41:25] [INFO ] State equation strengthened by 337 read => feed constraints.
[2024-05-24 19:41:26] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned [20, 96]
[2024-05-24 19:41:26] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1440 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1364/1796 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1364/1364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1458 ms. Remains : 123/128 places, 1364/1796 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-03 finished in 1764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 10 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 123 transition count 1204
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 123 transition count 1204
Applied a total of 10 rules in 20 ms. Remains 123 /128 variables (removed 5) and now considering 1204/1796 (removed 592) transitions.
[2024-05-24 19:41:26] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
// Phase 1: matrix 438 rows 123 cols
[2024-05-24 19:41:26] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:41:27] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-24 19:41:27] [INFO ] Flow matrix only has 438 transitions (discarded 766 similar events)
[2024-05-24 19:41:27] [INFO ] Invariant cache hit.
[2024-05-24 19:41:27] [INFO ] State equation strengthened by 297 read => feed constraints.
[2024-05-24 19:41:27] [INFO ] Implicit Places using invariants and state equation in 849 ms returned [20, 95]
[2024-05-24 19:41:27] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/128 places, 1204/1796 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 1204/1204 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1177 ms. Remains : 122/128 places, 1204/1796 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-06 finished in 1383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G(p2)&&p1))))'
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 123 transition count 1236
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 123 transition count 1236
Applied a total of 10 rules in 23 ms. Remains 123 /128 variables (removed 5) and now considering 1236/1796 (removed 560) transitions.
[2024-05-24 19:41:28] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
// Phase 1: matrix 446 rows 123 cols
[2024-05-24 19:41:28] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:41:28] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-24 19:41:28] [INFO ] Flow matrix only has 446 transitions (discarded 790 similar events)
[2024-05-24 19:41:28] [INFO ] Invariant cache hit.
[2024-05-24 19:41:28] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-24 19:41:28] [INFO ] Implicit Places using invariants and state equation in 642 ms returned [20, 95]
[2024-05-24 19:41:28] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 864 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/128 places, 1236/1796 transitions.
Applied a total of 0 rules in 5 ms. Remains 122 /122 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 893 ms. Remains : 122/128 places, 1236/1796 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-07 finished in 1273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1&&X(p0)))&&X(p2))))'
Support contains 17 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 1460
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 1460
Applied a total of 6 rules in 19 ms. Remains 125 /128 variables (removed 3) and now considering 1460/1796 (removed 336) transitions.
[2024-05-24 19:41:29] [INFO ] Flow matrix only has 502 transitions (discarded 958 similar events)
// Phase 1: matrix 502 rows 125 cols
[2024-05-24 19:41:29] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 19:41:29] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-24 19:41:29] [INFO ] Flow matrix only has 502 transitions (discarded 958 similar events)
[2024-05-24 19:41:29] [INFO ] Invariant cache hit.
[2024-05-24 19:41:29] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-24 19:41:30] [INFO ] Implicit Places using invariants and state equation in 581 ms returned [20, 97]
[2024-05-24 19:41:30] [INFO ] Actually due to overlaps returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 810 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1460/1796 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 1460/1460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 839 ms. Remains : 124/128 places, 1460/1796 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-08 finished in 1224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))&&F(p2)))'
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 76 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 118 transition count 1776
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 114 transition count 1776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 109 transition count 1184
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 109 transition count 1184
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 100 transition count 1175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1173
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1181
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 83 place count 94 transition count 1161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 94 transition count 1160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 93 transition count 1160
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 91 place count 90 transition count 1157
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 90 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 89 transition count 1156
Applied a total of 93 rules in 901 ms. Remains 89 /128 variables (removed 39) and now considering 1156/1796 (removed 640) transitions.
[2024-05-24 19:41:31] [INFO ] Flow matrix only has 330 transitions (discarded 826 similar events)
// Phase 1: matrix 330 rows 89 cols
[2024-05-24 19:41:31] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 19:41:31] [INFO ] Implicit Places using invariants in 226 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 228 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/128 places, 1156/1796 transitions.
Applied a total of 0 rules in 233 ms. Remains 88 /88 variables (removed 0) and now considering 1156/1156 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1362 ms. Remains : 88/128 places, 1156/1796 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-09 finished in 1604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 12 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 75 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 118 transition count 1776
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 114 transition count 1776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 109 transition count 1232
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 109 transition count 1232
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 45 place count 100 transition count 1223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1221
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1229
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 81 place count 94 transition count 1211
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 1 rules applied. Total rules applied 82 place count 94 transition count 1210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 83 place count 93 transition count 1210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 89 place count 90 transition count 1207
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 90 transition count 1206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 89 transition count 1206
Applied a total of 91 rules in 880 ms. Remains 89 /128 variables (removed 39) and now considering 1206/1796 (removed 590) transitions.
[2024-05-24 19:41:33] [INFO ] Flow matrix only has 343 transitions (discarded 863 similar events)
// Phase 1: matrix 343 rows 89 cols
[2024-05-24 19:41:33] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 19:41:33] [INFO ] Implicit Places using invariants in 253 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/128 places, 1206/1796 transitions.
Applied a total of 0 rules in 218 ms. Remains 88 /88 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1354 ms. Remains : 88/128 places, 1206/1796 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 1557 ms.
Product exploration explored 100000 steps with 0 reset in 1275 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 1024 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 449458 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 449458 steps, saw 185263 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-05-24 19:41:40] [INFO ] Flow matrix only has 343 transitions (discarded 863 similar events)
// Phase 1: matrix 343 rows 88 cols
[2024-05-24 19:41:40] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 19:41:40] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/83 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 336/419 variables, 83/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 137/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/430 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 124/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/431 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/431 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/78 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:40] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-24 19:41:40] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/83 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 336/419 variables, 83/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/430 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 124/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/431 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/431 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1477ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5798 steps, including 202 resets, run visited all 1 properties in 163 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 164 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Support contains 8 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1206/1206 transitions.
Applied a total of 0 rules in 265 ms. Remains 88 /88 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-24 19:41:42] [INFO ] Flow matrix only has 343 transitions (discarded 863 similar events)
[2024-05-24 19:41:42] [INFO ] Invariant cache hit.
[2024-05-24 19:41:42] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-24 19:41:42] [INFO ] Flow matrix only has 343 transitions (discarded 863 similar events)
[2024-05-24 19:41:42] [INFO ] Invariant cache hit.
[2024-05-24 19:41:42] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 19:41:43] [INFO ] Implicit Places using invariants and state equation in 853 ms returned [13, 66]
[2024-05-24 19:41:43] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1138 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/88 places, 1206/1206 transitions.
Applied a total of 0 rules in 262 ms. Remains 87 /87 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1665 ms. Remains : 87/88 places, 1206/1206 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 878 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 468028 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 468028 steps, saw 194428 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-24 19:41:47] [INFO ] Flow matrix only has 343 transitions (discarded 863 similar events)
// Phase 1: matrix 343 rows 87 cols
[2024-05-24 19:41:47] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 19:41:47] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/76 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:47] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/81 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 336/417 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 137/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/429 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 124/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/430 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/430 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/76 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/81 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 336/417 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 137/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/429 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/429 variables, 124/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/429 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/429 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/430 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/430 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 538 ms.
Support contains 8 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1206/1206 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 87 transition count 1194
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 12 place count 87 transition count 1188
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 26 place count 79 transition count 1188
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 1 with 1 rules applied. Total rules applied 27 place count 79 transition count 1187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 78 transition count 1186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 29 place count 78 transition count 1185
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 76 transition count 1185
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 76 transition count 1184
Drop transitions (Redundant composition of simpler transitions.) removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 4 with 67 rules applied. Total rules applied 100 place count 76 transition count 1117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 76 transition count 1116
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 75 transition count 1116
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 4 with 2 rules applied. Total rules applied 104 place count 74 transition count 1115
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 114 place count 74 transition count 1105
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 124 place count 64 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 176 transitions
Redundant transition composition rules discarded 176 transitions
Iterating global reduction 5 with 176 rules applied. Total rules applied 300 place count 64 transition count 929
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 301 place count 64 transition count 991
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 302 place count 63 transition count 991
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 306 place count 63 transition count 991
Applied a total of 306 rules in 824 ms. Remains 63 /87 variables (removed 24) and now considering 991/1206 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 63/87 places, 991/1206 transitions.
RANDOM walk for 40000 steps (8 resets) in 647 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 467768 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 467768 steps, saw 78313 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-24 19:41:53] [INFO ] Flow matrix only has 165 transitions (discarded 826 similar events)
// Phase 1: matrix 165 rows 63 cols
[2024-05-24 19:41:53] [INFO ] Computed 16 invariants in 5 ms
[2024-05-24 19:41:53] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/57 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 159/216 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 63/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/228 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 50/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 63/63 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/57 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 159/216 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 63/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/228 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 50/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:53] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 63/63 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 320 ms.
Support contains 8 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 991/991 transitions.
Applied a total of 0 rules in 195 ms. Remains 63 /63 variables (removed 0) and now considering 991/991 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 63/63 places, 991/991 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 991/991 transitions.
Applied a total of 0 rules in 194 ms. Remains 63 /63 variables (removed 0) and now considering 991/991 (removed 0) transitions.
[2024-05-24 19:41:54] [INFO ] Flow matrix only has 165 transitions (discarded 826 similar events)
[2024-05-24 19:41:54] [INFO ] Invariant cache hit.
[2024-05-24 19:41:55] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-24 19:41:55] [INFO ] Flow matrix only has 165 transitions (discarded 826 similar events)
[2024-05-24 19:41:55] [INFO ] Invariant cache hit.
[2024-05-24 19:41:55] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-24 19:41:55] [INFO ] Implicit Places using invariants and state equation in 446 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 631 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/63 places, 991/991 transitions.
Graph (complete) has 407 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 61 transition count 986
Applied a total of 6 rules in 200 ms. Remains 61 /62 variables (removed 1) and now considering 986/991 (removed 5) transitions.
[2024-05-24 19:41:55] [INFO ] Flow matrix only has 164 transitions (discarded 822 similar events)
// Phase 1: matrix 164 rows 61 cols
[2024-05-24 19:41:55] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 19:41:55] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-24 19:41:55] [INFO ] Flow matrix only has 164 transitions (discarded 822 similar events)
[2024-05-24 19:41:55] [INFO ] Invariant cache hit.
[2024-05-24 19:41:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 19:41:56] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/63 places, 986/991 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1646 ms. Remains : 61/63 places, 986/991 transitions.
RANDOM walk for 38259 steps (8 resets) in 1100 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1293 ms.
Product exploration explored 100000 steps with 0 reset in 1027 ms.
Built C files in :
/tmp/ltsmin15592483549391394532
[2024-05-24 19:41:59] [INFO ] Computing symmetric may disable matrix : 1206 transitions.
[2024-05-24 19:41:59] [INFO ] Computation of Complete disable matrix. took 138 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:41:59] [INFO ] Computing symmetric may enable matrix : 1206 transitions.
[2024-05-24 19:41:59] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:42:00] [INFO ] Computing Do-Not-Accords matrix : 1206 transitions.
[2024-05-24 19:42:00] [INFO ] Computation of Completed DNA matrix. took 103 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:42:00] [INFO ] Built C files in 966ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15592483549391394532
Running compilation step : cd /tmp/ltsmin15592483549391394532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15592483549391394532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15592483549391394532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 8 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 1206/1206 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 87 transition count 1205
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 86 transition count 1205
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 86 transition count 1203
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 6 place count 85 transition count 1202
Applied a total of 6 rules in 394 ms. Remains 85 /87 variables (removed 2) and now considering 1202/1206 (removed 4) transitions.
[2024-05-24 19:42:03] [INFO ] Flow matrix only has 286 transitions (discarded 916 similar events)
// Phase 1: matrix 286 rows 85 cols
[2024-05-24 19:42:03] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 19:42:04] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-24 19:42:04] [INFO ] Flow matrix only has 286 transitions (discarded 916 similar events)
[2024-05-24 19:42:04] [INFO ] Invariant cache hit.
[2024-05-24 19:42:04] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-24 19:42:04] [INFO ] Implicit Places using invariants and state equation in 705 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1008 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/87 places, 1202/1206 transitions.
Applied a total of 0 rules in 266 ms. Remains 84 /84 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1669 ms. Remains : 84/87 places, 1202/1206 transitions.
Built C files in :
/tmp/ltsmin10870015697147097447
[2024-05-24 19:42:05] [INFO ] Computing symmetric may disable matrix : 1202 transitions.
[2024-05-24 19:42:05] [INFO ] Computation of Complete disable matrix. took 238 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:42:05] [INFO ] Computing symmetric may enable matrix : 1202 transitions.
[2024-05-24 19:42:05] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:42:05] [INFO ] Computing Do-Not-Accords matrix : 1202 transitions.
[2024-05-24 19:42:05] [INFO ] Computation of Completed DNA matrix. took 102 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 19:42:06] [INFO ] Built C files in 972ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10870015697147097447
Running compilation step : cd /tmp/ltsmin10870015697147097447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10870015697147097447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10870015697147097447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:42:09] [INFO ] Flatten gal took : 88 ms
[2024-05-24 19:42:09] [INFO ] Flatten gal took : 81 ms
[2024-05-24 19:42:09] [INFO ] Time to serialize gal into /tmp/LTL14550268640320672268.gal : 15 ms
[2024-05-24 19:42:09] [INFO ] Time to serialize properties into /tmp/LTL14966227101463461664.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14550268640320672268.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17192917693659099737.hoa' '-atoms' '/tmp/LTL14966227101463461664.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14966227101463461664.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17192917693659099737.hoa
Detected timeout of ITS tools.
[2024-05-24 19:42:24] [INFO ] Flatten gal took : 86 ms
[2024-05-24 19:42:24] [INFO ] Flatten gal took : 87 ms
[2024-05-24 19:42:24] [INFO ] Time to serialize gal into /tmp/LTL5397505301670550286.gal : 15 ms
[2024-05-24 19:42:24] [INFO ] Time to serialize properties into /tmp/LTL6640935534765618613.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5397505301670550286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6640935534765618613.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((((p16==1)&&(p19==1))&&((p60==1)&&(p77==1)))&&(((p97==1)&&(p110==1))&&((p114==1)&&(p131==1))))"))||(G(F("((((p16!=1)||(p19!=1)...235
Formula 0 simplified : F!"((((p16==1)&&(p19==1))&&((p60==1)&&(p77==1)))&&(((p97==1)&&(p110==1))&&((p114==1)&&(p131==1))))" & FG!"((((p16!=1)||(p19!=1))||((...225
Detected timeout of ITS tools.
[2024-05-24 19:42:39] [INFO ] Flatten gal took : 90 ms
[2024-05-24 19:42:39] [INFO ] Applying decomposition
[2024-05-24 19:42:39] [INFO ] Flatten gal took : 90 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10338099134227561373.txt' '-o' '/tmp/graph10338099134227561373.bin' '-w' '/tmp/graph10338099134227561373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10338099134227561373.bin' '-l' '-1' '-v' '-w' '/tmp/graph10338099134227561373.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:42:40] [INFO ] Decomposing Gal with order
[2024-05-24 19:42:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:42:40] [INFO ] Removed a total of 6621 redundant transitions.
[2024-05-24 19:42:40] [INFO ] Flatten gal took : 301 ms
[2024-05-24 19:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 79 ms.
[2024-05-24 19:42:40] [INFO ] Time to serialize gal into /tmp/LTL1562755873878678689.gal : 7 ms
[2024-05-24 19:42:40] [INFO ] Time to serialize properties into /tmp/LTL946677242852415837.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1562755873878678689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL946677242852415837.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((G("((((i1.u2.p16==1)&&(i0.u7.p19==1))&&((i1.u11.p60==1)&&(i1.u14.p77==1)))&&(((i1.u3.p97==1)&&(i1.u2.p110==1))&&((i0.u10.p114==1)&...339
Formula 0 simplified : F!"((((i1.u2.p16==1)&&(i0.u7.p19==1))&&((i1.u11.p60==1)&&(i1.u14.p77==1)))&&(((i1.u3.p97==1)&&(i1.u2.p110==1))&&((i0.u10.p114==1)&&(...329
Reverse transition relation is NOT exact ! Due to transitions t13, t72, t75, t117, t1750, t1768, t1771, t1764_t3, t108_t54_t58, t108_t55, t1756_t83_t46_t84...548
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
297 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.0718,87196,1,0,86577,2441,10449,408373,650,12167,429996
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA EnergyBus-PT-none-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property EnergyBus-PT-none-LTLFireability-12 finished in 71860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 81 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 118 transition count 1775
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 113 transition count 1775
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 107 transition count 1103
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 107 transition count 1103
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 98 transition count 1094
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 98 transition count 1092
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 63 place count 92 transition count 1104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 67 place count 92 transition count 1100
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 85 place count 92 transition count 1082
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 92 transition count 1081
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 91 transition count 1081
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 93 place count 88 transition count 1078
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 88 transition count 1077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 95 place count 87 transition count 1077
Applied a total of 95 rules in 692 ms. Remains 87 /128 variables (removed 41) and now considering 1077/1796 (removed 719) transitions.
[2024-05-24 19:42:44] [INFO ] Flow matrix only has 314 transitions (discarded 763 similar events)
// Phase 1: matrix 314 rows 87 cols
[2024-05-24 19:42:44] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 19:42:44] [INFO ] Implicit Places using invariants in 200 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/128 places, 1077/1796 transitions.
Applied a total of 0 rules in 136 ms. Remains 86 /86 variables (removed 0) and now considering 1077/1077 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1030 ms. Remains : 86/128 places, 1077/1796 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA EnergyBus-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-13 finished in 1093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(!p1) U p2))))'
Support contains 13 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1796/1796 transitions.
Graph (trivial) has 77 edges and 128 vertex of which 10 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 122 transition count 1780
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 118 transition count 1780
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 118 transition count 1775
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 113 transition count 1775
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 108 transition count 1215
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 108 transition count 1215
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 45 place count 100 transition count 1207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 100 transition count 1205
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 94 transition count 1217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 94 transition count 1213
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 82 place count 94 transition count 1194
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 88 place count 91 transition count 1191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 91 transition count 1190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 90 transition count 1190
Applied a total of 90 rules in 968 ms. Remains 90 /128 variables (removed 38) and now considering 1190/1796 (removed 606) transitions.
[2024-05-24 19:42:46] [INFO ] Flow matrix only has 340 transitions (discarded 850 similar events)
// Phase 1: matrix 340 rows 90 cols
[2024-05-24 19:42:46] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 19:42:46] [INFO ] Implicit Places using invariants in 299 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 302 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/128 places, 1190/1796 transitions.
Applied a total of 0 rules in 295 ms. Remains 89 /89 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1565 ms. Remains : 89/128 places, 1190/1796 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : EnergyBus-PT-none-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA EnergyBus-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EnergyBus-PT-none-LTLFireability-15 finished in 1899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-24 19:42:47] [INFO ] Flatten gal took : 259 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3908221017291265827
[2024-05-24 19:42:47] [INFO ] Too many transitions (1796) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:42:47] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3908221017291265827
Running compilation step : cd /tmp/ltsmin3908221017291265827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 19:42:48] [INFO ] Applying decomposition
[2024-05-24 19:42:48] [INFO ] Flatten gal took : 180 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9686755145292714542.txt' '-o' '/tmp/graph9686755145292714542.bin' '-w' '/tmp/graph9686755145292714542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9686755145292714542.bin' '-l' '-1' '-v' '-w' '/tmp/graph9686755145292714542.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:42:48] [INFO ] Decomposing Gal with order
[2024-05-24 19:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:42:48] [INFO ] Removed a total of 8101 redundant transitions.
[2024-05-24 19:42:49] [INFO ] Flatten gal took : 288 ms
[2024-05-24 19:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 43 ms.
[2024-05-24 19:42:49] [INFO ] Time to serialize gal into /tmp/LTLFireability10240526663900753826.gal : 5 ms
[2024-05-24 19:42:49] [INFO ] Time to serialize properties into /tmp/LTLFireability11674559880935864927.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10240526663900753826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11674559880935864927.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i2.u6.p16==0)||(i1.u5.p19==0))||((i1.u14.p41==0)||(i1.u14.p58==0)))||(((i2.u6.p86==0)||(i0.u25.p108==0))||((i1.u5.p113==0)...180
Formula 0 simplified : GF!"((((i2.u6.p16==0)||(i1.u5.p19==0))||((i1.u14.p41==0)||(i1.u14.p58==0)))||(((i2.u6.p86==0)||(i0.u25.p108==0))||((i1.u5.p113==0)||...174
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t19, t52, t108, t117, t254, t255, t286, t287, t350, t351, t558, t559, t590, t591...670
Compilation finished in 11562 ms.
Running link step : cd /tmp/ltsmin3908221017291265827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin3908221017291265827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'

BK_STOP 1716580599236

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is EnergyBus-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-smll-171636266400220"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;