MCC'2024- Execution of r524-tall-171679080200372

About the Execution of LTSMin+red for SafeBus-COL-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
7877.359	3042988.00	7472070.00	4570.50	?TFFFFFFFF?FF???	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080200372.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 ltsminxred
Input is SafeBus-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080200372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 SafeBus-COL-10-LTLFireability-00
FORMULA_NAME SafeBus-COL-10-LTLFireability-01
FORMULA_NAME SafeBus-COL-10-LTLFireability-02
FORMULA_NAME SafeBus-COL-10-LTLFireability-03
FORMULA_NAME SafeBus-COL-10-LTLFireability-04
FORMULA_NAME SafeBus-COL-10-LTLFireability-05
FORMULA_NAME SafeBus-COL-10-LTLFireability-06
FORMULA_NAME SafeBus-COL-10-LTLFireability-07
FORMULA_NAME SafeBus-COL-10-LTLFireability-08
FORMULA_NAME SafeBus-COL-10-LTLFireability-09
FORMULA_NAME SafeBus-COL-10-LTLFireability-10
FORMULA_NAME SafeBus-COL-10-LTLFireability-11
FORMULA_NAME SafeBus-COL-10-LTLFireability-12
FORMULA_NAME SafeBus-COL-10-LTLFireability-13
FORMULA_NAME SafeBus-COL-10-LTLFireability-14
FORMULA_NAME SafeBus-COL-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717222455133

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:14:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:14:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:14:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 06:14:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:14:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2024-06-01 06:14:16] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-06-01 06:14:16] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 06:14:17] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2024-06-01 06:14:17] [INFO ] Skeletonized 13 HLPN properties in 1 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA SafeBus-COL-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 225 steps (0 resets) in 17 ms. (12 steps per ms) remains 0/11 properties
[2024-06-01 06:14:17] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:14:17] [INFO ] Flatten gal took : 4 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-06-01 06:14:17] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 59 ms.
[2024-06-01 06:14:17] [INFO ] Unfolded 14 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
[2024-06-01 06:14:17] [INFO ] Reduced 80 identical enabling conditions.
[2024-06-01 06:14:17] [INFO ] Reduced 80 identical enabling conditions.
[2024-06-01 06:14:17] [INFO ] Reduced 80 identical enabling conditions.
[2024-06-01 06:14:17] [INFO ] Reduced 80 identical enabling conditions.
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 20 places and 20 transitions.
FORMULA SafeBus-COL-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 215 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 65 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-06-01 06:14:17] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:14:17] [INFO ] Computed 45 invariants in 46 ms
[2024-06-01 06:14:18] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 06:14:18] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 06:14:18] [INFO ] Invariant cache hit.
[2024-06-01 06:14:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:14:18] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-06-01 06:14:18] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-06-01 06:14:18] [INFO ] Invariant cache hit.
[2024-06-01 06:14:18] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 22 ms to minimize.
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 52 places in 286 ms of which 14 ms to minimize.
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:14:33] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:14:34] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2024-06-01 06:14:44] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:14:44] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:14:44] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:14:44] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:14:45] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 2 ms to minimize.
[2024-06-01 06:14:45] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 2 ms to minimize.
[2024-06-01 06:14:45] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 2 ms to minimize.
[2024-06-01 06:14:46] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:14:46] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 2 ms to minimize.
[2024-06-01 06:14:47] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 06:15:05] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:15:05] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:15:06] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2024-06-01 06:15:06] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 1 ms to minimize.
[2024-06-01 06:15:06] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:15:06] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:15:06] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:15:07] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 1 ms to minimize.
[2024-06-01 06:15:07] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:15:07] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:15:10] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:15:10] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:15:10] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 2 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 2 ms to minimize.
[2024-06-01 06:15:11] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 2 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 2 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 4 ms to minimize.
[2024-06-01 06:15:12] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:15:22] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 1 ms to minimize.
[2024-06-01 06:15:23] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 88 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 43/43 constraints]
After SMT, in 64932ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64973ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66146 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 215 out of 306 places after structural reductions.
[2024-06-01 06:15:24] [INFO ] Flatten gal took : 239 ms
[2024-06-01 06:15:25] [INFO ] Flatten gal took : 197 ms
[2024-06-01 06:15:26] [INFO ] Input system was already deterministic with 1531 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 426 steps (0 resets) in 61 ms. (6 steps per ms) remains 0/13 properties
Computed a total of 0 stabilizing places and 0 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' '!(X(G((p0||F(p1)))))'
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 22 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:15:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:26] [INFO ] Invariant cache hit.
[2024-06-01 06:15:27] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-01 06:15:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:27] [INFO ] Invariant cache hit.
[2024-06-01 06:15:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:15:28] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:15:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:15:28] [INFO ] Invariant cache hit.
[2024-06-01 06:15:28] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:15:41] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:15:41] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 1 ms to minimize.
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:15:42] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:15:51] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:15:52] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 26 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:15:53] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:15:54] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:15:55] [INFO ] Deduced a trap composed of 49 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:15:55] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:16:14] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2024-06-01 06:16:15] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:16:15] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:16:15] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-06-01 06:16:15] [INFO ] Deduced a trap composed of 57 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:16:18] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:16:19] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:16:20] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:16:32] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:16:32] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64076ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64095ms
Finished structural reductions in LTL mode , in 1 iterations and 66157 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 858 reset in 961 ms.
Product exploration explored 100000 steps with 837 reset in 807 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 269 steps (0 resets) in 14 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 253 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:16:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:35] [INFO ] Invariant cache hit.
[2024-06-01 06:16:36] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-06-01 06:16:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:36] [INFO ] Invariant cache hit.
[2024-06-01 06:16:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:16:37] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2024-06-01 06:16:38] [INFO ] Redundant transitions in 102 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:16:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:16:38] [INFO ] Invariant cache hit.
[2024-06-01 06:16:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:16:50] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 2 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:16:51] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:16:52] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:17:00] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:17:01] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:17:02] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:17:03] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:17:04] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 1 ms to minimize.
[2024-06-01 06:17:04] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:17:23] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:17:24] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:17:25] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:17:27] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:17:28] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:17:29] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:17:41] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64209ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64224ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66656 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 205 steps (0 resets) in 18 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 836 reset in 810 ms.
Product exploration explored 100000 steps with 878 reset in 807 ms.
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 146 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:17:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:44] [INFO ] Invariant cache hit.
[2024-06-01 06:17:45] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 06:17:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:45] [INFO ] Invariant cache hit.
[2024-06-01 06:17:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:17:46] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2024-06-01 06:17:46] [INFO ] Redundant transitions in 52 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:17:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:17:46] [INFO ] Invariant cache hit.
[2024-06-01 06:17:46] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:17:59] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:17:59] [INFO ] Deduced a trap composed of 59 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:17:59] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:18:00] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:18:10] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:18:10] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 3 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:18:11] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:18:12] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:18:13] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:18:13] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 2 ms to minimize.
[2024-06-01 06:18:14] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 4 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:18:32] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:18:33] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:18:36] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:18:37] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:18:38] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2024-06-01 06:18:38] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:18:50] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:18:50] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63923ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66142 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-00 finished in 204567 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(X(p0))||F((G(p0)||X((X(!p1) U (X(G(!p1))||(!p2&&X(!p1)))))))))'
Support contains 32 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:51] [INFO ] Invariant cache hit.
[2024-06-01 06:18:51] [INFO ] Implicit Places using invariants in 390 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 396 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 389 ms.
Product exploration explored 100000 steps with 33333 reset in 354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLFireability-01 finished in 1500 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)))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 13 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:18:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:52] [INFO ] Invariant cache hit.
[2024-06-01 06:18:53] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 06:18:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:53] [INFO ] Invariant cache hit.
[2024-06-01 06:18:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:18:54] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:18:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:18:55] [INFO ] Invariant cache hit.
[2024-06-01 06:18:55] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:19:07] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:19:07] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:19:08] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:19:18] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:19:18] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:19:19] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:19:19] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2024-06-01 06:19:19] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:19:19] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:19:19] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:19:20] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:19:20] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:19:21] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:19:40] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 1 ms to minimize.
[2024-06-01 06:19:40] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:19:41] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:19:42] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:19:44] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:19:45] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:19:45] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:19:45] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:19:45] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:19:46] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 1 ms to minimize.
[2024-06-01 06:19:58] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64169ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64187ms
Finished structural reductions in LTL mode , in 1 iterations and 66452 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-02 finished in 66582 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 U p1))||F(G(p1)))))'
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:19:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:19:59] [INFO ] Invariant cache hit.
[2024-06-01 06:19:59] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 06:19:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:19:59] [INFO ] Invariant cache hit.
[2024-06-01 06:19:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:20:01] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:20:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:20:01] [INFO ] Invariant cache hit.
[2024-06-01 06:20:01] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:20:15] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:20:15] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:20:24] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 5 ms to minimize.
[2024-06-01 06:20:25] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:20:26] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:20:27] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:20:27] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:20:28] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 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 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 1 ms to minimize.
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 1 ms to minimize.
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
[2024-06-01 06:20:48] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:20:48] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:20:48] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:20:48] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:20:51] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:20:51] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:20:52] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:20:52] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:20:52] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:20:52] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64242ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64259ms
Finished structural reductions in LTL mode , in 1 iterations and 66157 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 517 ms.
Stack based approach found an accepted trace after 390 steps with 0 reset with depth 391 and stack size 391 in 3 ms.
FORMULA SafeBus-COL-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-03 finished in 66881 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)&&((!p1 U (p2||G(!p1))) U G(p1)))))'
Support contains 134 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:21:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:21:06] [INFO ] Invariant cache hit.
[2024-06-01 06:21:06] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 06:21:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:21:06] [INFO ] Invariant cache hit.
[2024-06-01 06:21:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:21:07] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:21:07] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:21:07] [INFO ] Invariant cache hit.
[2024-06-01 06:21:07] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 1 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:21:30] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:21:30] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:21:32] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:21:32] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:21:32] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:21:33] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:21:33] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:21:34] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 1 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:21:54] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:21:54] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 2 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:22:10] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64034ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64051ms
Finished structural reductions in LTL mode , in 1 iterations and 65423 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-04 finished in 65809 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)))'
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:22:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:22:12] [INFO ] Invariant cache hit.
[2024-06-01 06:22:12] [INFO ] Implicit Places using invariants in 190 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 192 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA SafeBus-COL-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-06 finished in 326 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&&X(!p1)))||G(!p0)))'
Support contains 141 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:22:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:22:12] [INFO ] Invariant cache hit.
[2024-06-01 06:22:12] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 06:22:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:22:12] [INFO ] Invariant cache hit.
[2024-06-01 06:22:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:22:13] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:22:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:22:13] [INFO ] Invariant cache hit.
[2024-06-01 06:22:13] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:22:27] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:22:27] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:22:27] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:22:36] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:22:36] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:22:36] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 5 ms to minimize.
[2024-06-01 06:22:36] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:22:37] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:22:38] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:22:39] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:22:39] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:22:39] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:22:59] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:23:00] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 1 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:23:04] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:23:04] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:23:04] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:23:04] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 63813ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63827ms
Finished structural reductions in LTL mode , in 1 iterations and 64870 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 282 ms :[p1, (AND p0 p1), true, (OR p0 p1), p0, p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-07 finished in 65187 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))))'
Support contains 31 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:23:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:23:17] [INFO ] Invariant cache hit.
[2024-06-01 06:23:17] [INFO ] Implicit Places using invariants in 428 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 430 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 527 ms.
Stack based approach found an accepted trace after 459 steps with 0 reset with depth 460 and stack size 460 in 4 ms.
FORMULA SafeBus-COL-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-09 finished in 1079 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(F(!p0)))'
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:23:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:23:18] [INFO ] Invariant cache hit.
[2024-06-01 06:23:18] [INFO ] Implicit Places using invariants in 191 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 193 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-10
Product exploration explored 100000 steps with 13018 reset in 3743 ms.
Product exploration explored 100000 steps with 12998 reset in 3746 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[p0, p0]
RANDOM walk for 25 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 84 ms :[p0, p0]
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
[2024-06-01 06:23:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-06-01 06:23:27] [INFO ] Computed 35 invariants in 16 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:23:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Support contains 121 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 160 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 06:23:45] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 06:23:45] [INFO ] Computed 35 invariants in 9 ms
[2024-06-01 06:23:45] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 06:23:45] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:23:45] [INFO ] Invariant cache hit.
[2024-06-01 06:23:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:23:46] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2024-06-01 06:23:46] [INFO ] Redundant transitions in 28 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 06:23:46] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:23:46] [INFO ] Invariant cache hit.
[2024-06-01 06:23:46] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 2 ms to minimize.
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 2 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:24:09] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:24:09] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:24:10] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:24:10] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:24:13] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:24:13] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:24:13] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:24:13] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:24:14] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:24:14] [INFO ] Deduced a trap composed of 90 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:24:14] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:24:31] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:24:31] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:24:31] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:24:31] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 1 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:24:38] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:24:38] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:24:39] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:24:41] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:24:41] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2024-06-01 06:24:50] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 83 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 48/48 constraints]
After SMT, in 64737ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 286/296 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65875 ms. Remains : 286/296 places, 1521/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 81 ms :[p0, p0]
RANDOM walk for 16 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 82 ms :[p0, p0]
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
[2024-06-01 06:24:51] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:24:52] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:25:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
Product exploration explored 100000 steps with 13100 reset in 4830 ms.
Product exploration explored 100000 steps with 13010 reset in 4849 ms.
Support contains 121 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 103 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 06:25:19] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:25:19] [INFO ] Invariant cache hit.
[2024-06-01 06:25:20] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 06:25:20] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:25:20] [INFO ] Invariant cache hit.
[2024-06-01 06:25:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:25:20] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2024-06-01 06:25:20] [INFO ] Redundant transitions in 24 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 06:25:20] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:25:20] [INFO ] Invariant cache hit.
[2024-06-01 06:25:20] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:25:33] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:25:33] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 1 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:25:43] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:25:43] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:25:43] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:25:43] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:25:46] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 1 ms to minimize.
[2024-06-01 06:25:46] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 90 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 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 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:26:05] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 2 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:26:06] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:26:07] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:26:09] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:26:09] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:26:09] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:26:09] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 1 ms to minimize.
[2024-06-01 06:26:10] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:26:10] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:26:10] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 42 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:26:14] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:26:16] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:26:16] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:26:16] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:26:16] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:26:17] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:26:17] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:26:17] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 49/49 constraints]
After SMT, in 64623ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65633 ms. Remains : 286/286 places, 1521/1521 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-10 finished in 187056 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))))'
Support contains 132 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 102 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:26:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:26:25] [INFO ] Computed 45 invariants in 15 ms
[2024-06-01 06:26:25] [INFO ] Implicit Places using invariants in 226 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 227 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 107 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 06:26:26] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 06:26:26] [INFO ] Computed 35 invariants in 8 ms
[2024-06-01 06:26:26] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 06:26:26] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:26:26] [INFO ] Invariant cache hit.
[2024-06-01 06:26:26] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:26:26] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1338 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-11
Product exploration timeout after 60820 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 560 steps with 0 reset with depth 561 and stack size 561 in 93 ms.
FORMULA SafeBus-COL-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-11 finished in 11502 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(((p1&&X(X(p2)))||p0)))'
Support contains 161 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:26:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:26:37] [INFO ] Computed 45 invariants in 11 ms
[2024-06-01 06:26:37] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 06:26:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:26:37] [INFO ] Invariant cache hit.
[2024-06-01 06:26:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:26:38] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:26:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:26:38] [INFO ] Invariant cache hit.
[2024-06-01 06:26:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 35 places in 775 ms of which 2 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 1 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:27:01] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 2 ms to minimize.
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:27:24] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:27:27] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:27:29] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 63652ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63666ms
Finished structural reductions in LTL mode , in 1 iterations and 64568 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-13
Product exploration explored 100000 steps with 32252 reset in 6800 ms.
Product exploration explored 100000 steps with 32283 reset in 6793 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 251 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 480 steps (0 resets) in 59 ms. (8 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 511 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 161 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:27:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:27:56] [INFO ] Invariant cache hit.
[2024-06-01 06:27:57] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 06:27:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:27:57] [INFO ] Invariant cache hit.
[2024-06-01 06:27:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:27:57] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:27:57] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:27:57] [INFO ] Invariant cache hit.
[2024-06-01 06:27:57] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:28:11] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 1 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 2 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:28:25] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:28:50] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64738ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64763ms
Finished structural reductions in LTL mode , in 1 iterations and 65745 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 272 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 358 steps (0 resets) in 78 ms. (4 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 492 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 32248 reset in 6708 ms.
Product exploration explored 100000 steps with 32240 reset in 6741 ms.
Support contains 161 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 3 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:29:17] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:29:17] [INFO ] Invariant cache hit.
[2024-06-01 06:29:18] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 06:29:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:29:18] [INFO ] Invariant cache hit.
[2024-06-01 06:29:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:29:18] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:29:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:29:18] [INFO ] Invariant cache hit.
[2024-06-01 06:29:18] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:29:42] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:29:43] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 3 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:29:44] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:29:45] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:29:46] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 1 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 57 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:30:10] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64692ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64711ms
Finished structural reductions in LTL mode , in 1 iterations and 65532 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-13 finished in 226441 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(F(!p0)) U !p1))'
Support contains 22 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 139 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:30:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:30:23] [INFO ] Invariant cache hit.
[2024-06-01 06:30:24] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 06:30:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:30:24] [INFO ] Invariant cache hit.
[2024-06-01 06:30:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:30:25] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
[2024-06-01 06:30:26] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:30:26] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:30:26] [INFO ] Invariant cache hit.
[2024-06-01 06:30:26] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 2 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 1 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:30:51] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:30:53] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:30:53] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:30:53] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 1 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 1 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 2 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 2 ms to minimize.
[2024-06-01 06:31:17] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 1 ms to minimize.
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:31:18] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 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 Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 65243ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 65258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67690 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 118 ms :[p1, p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-14
Product exploration explored 100000 steps with 1108 reset in 451 ms.
Product exploration explored 100000 steps with 1077 reset in 455 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[p1, p0, p0]
RANDOM walk for 215 steps (0 resets) in 14 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[p1, p0, p0]
Stuttering acceptance computed with spot in 214 ms :[p1, p0, p0]
[2024-06-01 06:31:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:31:33] [INFO ] Invariant cache hit.
[2024-06-01 06:31:33] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2024-06-01 06:31:33] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 25 ms returned sat
[2024-06-01 06:31:34] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-06-01 06:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:31:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-06-01 06:31:34] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 28 ms returned sat
[2024-06-01 06:31:35] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-06-01 06:31:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:31:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 57 ms returned sat
[2024-06-01 06:31:35] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 91 ms.
[2024-06-01 06:31:35] [INFO ] Added : 0 causal constraints over 0 iterations in 161 ms. Result :sat
Could not prove EG p1
Support contains 22 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 118 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:31:35] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:31:35] [INFO ] Invariant cache hit.
[2024-06-01 06:31:36] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 06:31:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:31:36] [INFO ] Invariant cache hit.
[2024-06-01 06:31:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:31:37] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
[2024-06-01 06:31:37] [INFO ] Redundant transitions in 27 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:31:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:31:37] [INFO ] Invariant cache hit.
[2024-06-01 06:31:37] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:32:01] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:32:01] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:32:01] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:32:03] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2024-06-01 06:32:03] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:32:04] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:32:04] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:32:04] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:32:24] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2024-06-01 06:32:24] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:32:24] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:32:25] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:32:25] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:32:25] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:32:25] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:32:25] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:32:28] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 2 ms to minimize.
[2024-06-01 06:32:28] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:32:29] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 2 ms to minimize.
[2024-06-01 06:32:29] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:32:29] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:32:29] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 1 ms to minimize.
[2024-06-01 06:32:30] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 1 ms to minimize.
[2024-06-01 06:32:30] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2024-06-01 06:32:30] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 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 Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64449ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64464ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66777 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p1, p0, p0]
RANDOM walk for 247 steps (0 resets) in 9 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[p1, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p1, p0, p0]
[2024-06-01 06:32:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:32:43] [INFO ] Invariant cache hit.
[2024-06-01 06:32:43] [INFO ] [Real]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-06-01 06:32:43] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 31 ms returned sat
[2024-06-01 06:32:44] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-06-01 06:32:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-06-01 06:32:44] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 29 ms returned sat
[2024-06-01 06:32:45] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-06-01 06:32:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:32:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 55 ms returned sat
[2024-06-01 06:32:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 63 ms.
[2024-06-01 06:32:45] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 110 ms :[p1, p0, p0]
Product exploration explored 100000 steps with 1120 reset in 443 ms.
Product exploration explored 100000 steps with 1102 reset in 462 ms.
Support contains 22 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 119 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:32:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:32:46] [INFO ] Invariant cache hit.
[2024-06-01 06:32:46] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 06:32:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:32:46] [INFO ] Invariant cache hit.
[2024-06-01 06:32:47] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:32:48] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2218 ms to find 0 implicit places.
[2024-06-01 06:32:48] [INFO ] Redundant transitions in 28 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:32:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:32:48] [INFO ] Invariant cache hit.
[2024-06-01 06:32:48] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:33:03] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:33:03] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2024-06-01 06:33:03] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2024-06-01 06:33:13] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:33:17] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:33:17] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 1 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 1 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 57 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 40 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64302ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66694 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-14 finished in 209735 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(F((!p0 U (p1||G(!p0))))))'
Support contains 114 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 99 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:33:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:33:53] [INFO ] Invariant cache hit.
[2024-06-01 06:33:53] [INFO ] Implicit Places using invariants in 249 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 251 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 113 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 06:33:53] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 06:33:53] [INFO ] Computed 35 invariants in 12 ms
[2024-06-01 06:33:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 06:33:53] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:33:54] [INFO ] Invariant cache hit.
[2024-06-01 06:33:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:33:54] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1607 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-15
Product exploration explored 100000 steps with 1294 reset in 795 ms.
Product exploration explored 100000 steps with 1270 reset in 800 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 74 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 114 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 97 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 06:33:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:33:57] [INFO ] Invariant cache hit.
[2024-06-01 06:33:57] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 06:33:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:33:57] [INFO ] Invariant cache hit.
[2024-06-01 06:33:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:33:58] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2024-06-01 06:33:58] [INFO ] Redundant transitions in 26 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 06:33:58] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:33:58] [INFO ] Invariant cache hit.
[2024-06-01 06:33:58] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 60 places in 214 ms of which 1 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:34:24] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:34:25] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 90 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:34:26] [INFO ] Deduced a trap composed of 86 places in 212 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 1 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 1 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 2 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:34:54] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:34:55] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:34:55] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2024-06-01 06:35:02] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 83 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 48/48 constraints]
After SMT, in 64347ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65620 ms. Remains : 286/286 places, 1521/1521 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 176 steps (0 resets) in 9 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1313 reset in 461 ms.
Product exploration explored 100000 steps with 1287 reset in 465 ms.
Support contains 114 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 89 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 06:35:04] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:35:04] [INFO ] Invariant cache hit.
[2024-06-01 06:35:05] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 06:35:05] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:35:05] [INFO ] Invariant cache hit.
[2024-06-01 06:35:05] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:35:06] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2024-06-01 06:35:06] [INFO ] Redundant transitions in 24 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 06:35:06] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:35:06] [INFO ] Invariant cache hit.
[2024-06-01 06:35:06] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:35:18] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:35:18] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 90 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 86 places in 221 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 1 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 1 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:35:57] [INFO ] Deduced a trap composed of 42 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:35:58] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2024-06-01 06:35:58] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 1 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 83 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 48/48 constraints]
After SMT, in 64232ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65504 ms. Remains : 286/286 places, 1521/1521 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-15 finished in 137267 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||F(p1)))))'
Found a Lengthening insensitive property : SafeBus-COL-10-LTLFireability-00
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 23 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:36:10] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-06-01 06:36:10] [INFO ] Computed 45 invariants in 10 ms
[2024-06-01 06:36:11] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-06-01 06:36:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:36:11] [INFO ] Invariant cache hit.
[2024-06-01 06:36:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:36:12] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:36:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:36:12] [INFO ] Invariant cache hit.
[2024-06-01 06:36:12] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 1 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 2 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 57 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 63599ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63617ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 65653 ms. Remains : 306/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-00
Product exploration explored 100000 steps with 862 reset in 822 ms.
Product exploration explored 100000 steps with 818 reset in 833 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 217 steps (0 resets) in 9 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 115 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:37:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:37:18] [INFO ] Invariant cache hit.
[2024-06-01 06:37:19] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-06-01 06:37:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:37:19] [INFO ] Invariant cache hit.
[2024-06-01 06:37:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:37:20] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2024-06-01 06:37:20] [INFO ] Redundant transitions in 21 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:37:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:37:20] [INFO ] Invariant cache hit.
[2024-06-01 06:37:20] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 1 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 1 ms to minimize.
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 3 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:38:07] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:38:07] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2024-06-01 06:38:07] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:38:07] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:38:08] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:38:08] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:38:08] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:38:08] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 2 ms to minimize.
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 2 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 53 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 3 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 1 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 82 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 37/37 constraints]
After SMT, in 64425ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64439ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66575 ms. Remains : 306/306 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 268 steps (0 resets) in 13 ms. (19 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 830 reset in 847 ms.
Product exploration explored 100000 steps with 823 reset in 833 ms.
Support contains 50 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 117 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:38:27] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:38:27] [INFO ] Invariant cache hit.
[2024-06-01 06:38:28] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 06:38:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:38:28] [INFO ] Invariant cache hit.
[2024-06-01 06:38:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:38:29] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2024-06-01 06:38:29] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:38:29] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:38:29] [INFO ] Invariant cache hit.
[2024-06-01 06:38:29] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 2 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:38:56] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:38:56] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:38:56] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:39:15] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:39:15] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:39:15] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2024-06-01 06:39:15] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:39:16] [INFO ] Deduced a trap composed of 57 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:39:19] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:39:19] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 1 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-06-01 06:39:33] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:39:33] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 64228ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66394 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-00 finished in 203789 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(F(!p0)))'
Found a Shortening insensitive property : SafeBus-COL-10-LTLFireability-10
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Support contains 121 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 17 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-06-01 06:39:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-06-01 06:39:34] [INFO ] Invariant cache hit.
[2024-06-01 06:39:34] [INFO ] Implicit Places using invariants in 193 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 195 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 14 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-06-01 06:39:34] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-06-01 06:39:34] [INFO ] Computed 35 invariants in 6 ms
[2024-06-01 06:39:34] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 06:39:34] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:39:34] [INFO ] Invariant cache hit.
[2024-06-01 06:39:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:39:35] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1036 ms. Remains : 286/306 places, 1521/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-10
Product exploration explored 100000 steps with 13046 reset in 3684 ms.
Product exploration explored 100000 steps with 12934 reset in 3754 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
RANDOM walk for 20 steps (0 resets) in 7 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 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 124 ms :[p0, p0]
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
[2024-06-01 06:39:43] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:39:44] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:40:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Support contains 121 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 103 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 06:40:02] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:40:02] [INFO ] Invariant cache hit.
[2024-06-01 06:40:02] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 06:40:02] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:40:02] [INFO ] Invariant cache hit.
[2024-06-01 06:40:02] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:40:03] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2024-06-01 06:40:03] [INFO ] Redundant transitions in 19 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 06:40:03] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:40:03] [INFO ] Invariant cache hit.
[2024-06-01 06:40:03] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 2 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 2 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:40:24] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:40:24] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-06-01 06:40:25] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:40:25] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:40:25] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:40:25] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:40:28] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 2 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 2 ms to minimize.
[2024-06-01 06:40:29] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:40:30] [INFO ] Deduced a trap composed of 90 places in 227 ms of which 2 ms to minimize.
[2024-06-01 06:40:30] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:40:30] [INFO ] Deduced a trap composed of 86 places in 213 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 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 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:40:47] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:40:49] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 1 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:40:51] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:40:51] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:40:51] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:40:51] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:40:52] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:40:52] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 4 ms to minimize.
[2024-06-01 06:40:52] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 1 ms to minimize.
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:40:58] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:40:58] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:40:58] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:40:58] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:40:59] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:40:59] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:40:59] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 49/49 constraints]
After SMT, in 64301ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65318 ms. Remains : 286/286 places, 1521/1521 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 82 ms :[p0, p0]
RANDOM walk for 20 steps (0 resets) in 8 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 80 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
[2024-06-01 06:41:08] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:41:08] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 06:41:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Product exploration explored 100000 steps with 13040 reset in 4767 ms.
Product exploration explored 100000 steps with 12995 reset in 4771 ms.
Support contains 121 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 108 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-06-01 06:41:36] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:41:36] [INFO ] Invariant cache hit.
[2024-06-01 06:41:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 06:41:36] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:41:36] [INFO ] Invariant cache hit.
[2024-06-01 06:41:36] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 06:41:37] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2024-06-01 06:41:37] [INFO ] Redundant transitions in 23 ms returned []
Running 1511 sub problems to find dead transitions.
[2024-06-01 06:41:37] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-06-01 06:41:37] [INFO ] Invariant cache hit.
[2024-06-01 06:41:37] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:41:50] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:41:50] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 1 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 2 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 1 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 2 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 90 places in 223 ms of which 2 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 55 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1511/1511 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 1 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 2 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:42:29] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 2 ms to minimize.
[2024-06-01 06:42:29] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:42:29] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1511 unsolved
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 1 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 84 constraints, problems are : Problem set: 0 solved, 1511 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1511 constraints, Known Traps: 49/49 constraints]
After SMT, in 64747ms problems are : Problem set: 0 solved, 1511 unsolved
Search for dead transitions found 0 dead transitions in 64761ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65748 ms. Remains : 286/286 places, 1521/1521 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-10 finished in 187812 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(((p1&&X(X(p2)))||p0)))'
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(F(!p0)) U !p1))'
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(F((!p0 U (p1||G(!p0))))))'
[2024-06-01 06:42:42] [INFO ] Flatten gal took : 131 ms
[2024-06-01 06:42:42] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 26 ms.
[2024-06-01 06:42:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 10 ms.
Total runtime 1706457 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-00
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-10
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-13
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-14
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-15

BK_STOP 1717225498121

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SafeBus-COL-10-LTLFireability-00
ltl formula formula --ltl=/tmp/4991/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.050 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4991/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4991/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4991/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4991/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name SafeBus-COL-10-LTLFireability-10
ltl formula formula --ltl=/tmp/4991/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.330 real 0.080 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4991/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4991/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4991/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4991/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name SafeBus-COL-10-LTLFireability-13
ltl formula formula --ltl=/tmp/4991/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.050 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4991/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4991/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4991/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4991/ltl_2_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name SafeBus-COL-10-LTLFireability-14
ltl formula formula --ltl=/tmp/4991/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.050 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4991/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4991/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4991/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4991/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 4606 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name SafeBus-COL-10-LTLFireability-15
ltl formula formula --ltl=/tmp/4991/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.050 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4991/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4991/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4991/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4991/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported

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="SafeBus-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SafeBus-COL-10, 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 r524-tall-171679080200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 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 ;