MCC'2024- Execution of r333-tall-171679078400419

About the Execution of GreatSPN+red for SafeBus-PT-06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3655.104	831379.00	1064410.00	2253.60	FFTTFTTFTTFFFFFF	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.r333-tall-171679078400419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SafeBus-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078400419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 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 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K 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-PT-06-LTLCardinality-00
FORMULA_NAME SafeBus-PT-06-LTLCardinality-01
FORMULA_NAME SafeBus-PT-06-LTLCardinality-02
FORMULA_NAME SafeBus-PT-06-LTLCardinality-03
FORMULA_NAME SafeBus-PT-06-LTLCardinality-04
FORMULA_NAME SafeBus-PT-06-LTLCardinality-05
FORMULA_NAME SafeBus-PT-06-LTLCardinality-06
FORMULA_NAME SafeBus-PT-06-LTLCardinality-07
FORMULA_NAME SafeBus-PT-06-LTLCardinality-08
FORMULA_NAME SafeBus-PT-06-LTLCardinality-09
FORMULA_NAME SafeBus-PT-06-LTLCardinality-10
FORMULA_NAME SafeBus-PT-06-LTLCardinality-11
FORMULA_NAME SafeBus-PT-06-LTLCardinality-12
FORMULA_NAME SafeBus-PT-06-LTLCardinality-13
FORMULA_NAME SafeBus-PT-06-LTLCardinality-14
FORMULA_NAME SafeBus-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716856040089

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:27:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:27:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:27:21] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-28 00:27:21] [INFO ] Transformed 144 places.
[2024-05-28 00:27:21] [INFO ] Transformed 451 transitions.
[2024-05-28 00:27:21] [INFO ] Found NUPN structural information;
[2024-05-28 00:27:21] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-28 00:27:21] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:27:21] [INFO ] Computed 29 invariants in 24 ms
[2024-05-28 00:27:22] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-28 00:27:22] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-28 00:27:22] [INFO ] Invariant cache hit.
[2024-05-28 00:27:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:27:22] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-28 00:27:22] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-28 00:27:22] [INFO ] Invariant cache hit.
[2024-05-28 00:27:22] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-28 00:27:24] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 31 ms to minimize.
[2024-05-28 00:27:25] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2024-05-28 00:27:25] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 2 ms to minimize.
[2024-05-28 00:27:25] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:27:30] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 00:27:31] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:27:31] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:27:31] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:27:31] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/198 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-28 00:27:32] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:27:33] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:27:33] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:27:33] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 3 ms to minimize.
[2024-05-28 00:27:33] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 5/203 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-28 00:27:34] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:27:35] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:27:35] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:27:35] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/380 variables, 138/345 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 43/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 388 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30063 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 40/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-28 00:27:55] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:27:56] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 8/215 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-28 00:28:02] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:28:02] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:28:02] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/356 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/399 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/808 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 808 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30037 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 51/51 constraints]
After SMT, in 60737ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60768ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61507 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 80 out of 138 places after structural reductions.
[2024-05-28 00:28:23] [INFO ] Flatten gal took : 64 ms
[2024-05-28 00:28:23] [INFO ] Flatten gal took : 36 ms
[2024-05-28 00:28:23] [INFO ] Input system was already deterministic with 415 transitions.
Support contains 74 out of 138 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1651 ms. (24 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
[2024-05-28 00:28:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:28:24] [INFO ] Computed 29 invariants in 6 ms
[2024-05-28 00:28:24] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/90 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/106 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 16/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 106/380 variables, and 118 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Domain max(s): 106/138 constraints, Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 1/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SafeBus-PT-06-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SafeBus-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0 U (p1||G(p0))))'
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 37 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:28:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:28:24] [INFO ] Invariant cache hit.
[2024-05-28 00:28:24] [INFO ] Implicit Places using invariants in 309 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 315 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 22 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 375 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA SafeBus-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-00 finished in 587 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(F(p0)) U (F(p1) U p0))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:28:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:28:24] [INFO ] Invariant cache hit.
[2024-05-28 00:28:25] [INFO ] Implicit Places using invariants in 443 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 444 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 13 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 462 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 198 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLCardinality-02 finished in 1064 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 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:28:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:28:26] [INFO ] Invariant cache hit.
[2024-05-28 00:28:26] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-28 00:28:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:28:26] [INFO ] Invariant cache hit.
[2024-05-28 00:28:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:28:26] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-28 00:28:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:28:26] [INFO ] Invariant cache hit.
[2024-05-28 00:28:26] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:28] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-28 00:28:28] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:28:28] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-28 00:28:28] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:28:29] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
[2024-05-28 00:28:29] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:28:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 00:28:29] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:28:29] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:28:29] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-28 00:28:30] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:28:30] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-28 00:28:30] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-28 00:28:30] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 1 ms to minimize.
[2024-05-28 00:28:30] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:28:30] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-28 00:28:31] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:28:31] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:28:31] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:28:31] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:33] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:35] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:28:35] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:28:35] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:28:35] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:28:35] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-05-28 00:28:35] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:28:36] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:28:36] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:28:36] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:37] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:40] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:28:40] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:42] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:28:44] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:13] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-28 00:29:13] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-28 00:29:13] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 00:29:13] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:24] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60470ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in LTL mode , in 1 iterations and 61187 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 158 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLCardinality-03 finished in 61626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:29:27] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:29:27] [INFO ] Invariant cache hit.
[2024-05-28 00:29:27] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-28 00:29:27] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:29:27] [INFO ] Invariant cache hit.
[2024-05-28 00:29:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:29:28] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2024-05-28 00:29:28] [INFO ] Redundant transitions in 31 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-28 00:29:28] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:29:28] [INFO ] Invariant cache hit.
[2024-05-28 00:29:28] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:30] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:29:30] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:29:30] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:29:30] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:29:30] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:29:31] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:29:32] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-28 00:29:32] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:29:32] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:29:32] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:29:32] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:29:32] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:35] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:36] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:29:37] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:39] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:42] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-28 00:29:42] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:44] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:29:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:15] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:30:15] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-28 00:30:15] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 00:30:15] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:26] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61158 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 1531 reset in 283 ms.
Stack based approach found an accepted trace after 1429 steps with 23 reset with depth 94 and stack size 94 in 6 ms.
FORMULA SafeBus-PT-06-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-04 finished in 61498 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 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:30:29] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:30:29] [INFO ] Invariant cache hit.
[2024-05-28 00:30:29] [INFO ] Implicit Places using invariants in 318 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 328 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 337 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Product exploration explored 100000 steps with 50000 reset in 141 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLCardinality-06 finished in 749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:30:29] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:30:29] [INFO ] Invariant cache hit.
[2024-05-28 00:30:30] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-28 00:30:30] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:30:30] [INFO ] Invariant cache hit.
[2024-05-28 00:30:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:30:30] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-28 00:30:30] [INFO ] Redundant transitions in 4 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-28 00:30:30] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:30:30] [INFO ] Invariant cache hit.
[2024-05-28 00:30:30] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:32] [INFO ] Deduced a trap composed of 22 places in 386 ms of which 1 ms to minimize.
[2024-05-28 00:30:32] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:30:33] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:30:33] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-28 00:30:33] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2024-05-28 00:30:33] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-28 00:30:33] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-28 00:30:34] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:30:35] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:30:35] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:30:35] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:30:35] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:30:35] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:30:35] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:38] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:39] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:30:39] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:30:39] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2024-05-28 00:30:40] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:30:40] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:30:40] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:30:40] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:30:40] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-28 00:30:40] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:41] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:44] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:30:45] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:46] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:30:48] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:31:17] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:31:17] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-28 00:31:17] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2024-05-28 00:31:18] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-28 00:31:29] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61319 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-07 finished in 61446 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)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:31:31] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-28 00:31:31] [INFO ] Invariant cache hit.
[2024-05-28 00:31:31] [INFO ] Implicit Places using invariants in 290 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 292 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 37 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-05-28 00:31:31] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-28 00:31:31] [INFO ] Computed 23 invariants in 10 ms
[2024-05-28 00:31:31] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-28 00:31:31] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:31:31] [INFO ] Invariant cache hit.
[2024-05-28 00:31:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:31:32] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1033 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-08
Product exploration explored 100000 steps with 5721 reset in 282 ms.
Product exploration explored 100000 steps with 5747 reset in 364 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 based reduction with 3 factoid took 176 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 42 steps (0 resets) in 5 ms. (7 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 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 22 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-05-28 00:31:33] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:31:33] [INFO ] Invariant cache hit.
[2024-05-28 00:31:33] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-28 00:31:33] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:31:33] [INFO ] Invariant cache hit.
[2024-05-28 00:31:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:31:34] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2024-05-28 00:31:34] [INFO ] Redundant transitions in 3 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-28 00:31:34] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:31:34] [INFO ] Invariant cache hit.
[2024-05-28 00:31:34] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-28 00:31:37] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:31:37] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:31:38] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:31:38] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-05-28 00:31:38] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:31:38] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:31:38] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:31:38] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:31:39] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:31:40] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:31:40] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 19/162 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-28 00:31:42] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:31:43] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:31:43] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:31:43] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:31:43] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 330 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30027 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 24/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 847 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30016 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
After SMT, in 61465ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62198 ms. Remains : 120/120 places, 523/523 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 108 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 47 steps (0 resets) in 6 ms. (6 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 134 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5662 reset in 244 ms.
Product exploration explored 100000 steps with 5821 reset in 254 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 30 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-05-28 00:32:36] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:32:36] [INFO ] Invariant cache hit.
[2024-05-28 00:32:37] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 00:32:37] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:32:37] [INFO ] Invariant cache hit.
[2024-05-28 00:32:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:32:37] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2024-05-28 00:32:37] [INFO ] Redundant transitions in 2 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-28 00:32:37] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:32:37] [INFO ] Invariant cache hit.
[2024-05-28 00:32:37] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-28 00:32:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:32:40] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:32:41] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2024-05-28 00:32:41] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-28 00:32:41] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-28 00:32:41] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-28 00:32:42] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:32:43] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 19/162 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-28 00:32:46] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:32:46] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:32:46] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2024-05-28 00:32:47] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2024-05-28 00:32:47] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 330 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30020 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 24/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/287 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 847 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30019 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 24/24 constraints]
After SMT, in 61382ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61387ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62151 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-PT-06-LTLCardinality-08 finished in 127802 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)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:33:39] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:33:39] [INFO ] Computed 29 invariants in 2 ms
[2024-05-28 00:33:39] [INFO ] Implicit Places using invariants in 453 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 454 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 121 transition count 504
Applied a total of 22 rules in 34 ms. Remains 121 /132 variables (removed 11) and now considering 504/415 (removed -89) transitions.
[2024-05-28 00:33:39] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
// Phase 1: matrix 331 rows 121 cols
[2024-05-28 00:33:39] [INFO ] Computed 23 invariants in 7 ms
[2024-05-28 00:33:39] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 00:33:39] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:33:39] [INFO ] Invariant cache hit.
[2024-05-28 00:33:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:33:40] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/138 places, 504/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1230 ms. Remains : 121/138 places, 504/415 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-09
Product exploration explored 100000 steps with 715 reset in 336 ms.
Product exploration explored 100000 steps with 708 reset in 353 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 463 steps (0 resets) in 7 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 504/504 transitions.
Applied a total of 0 rules in 19 ms. Remains 121 /121 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-28 00:33:41] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:33:41] [INFO ] Invariant cache hit.
[2024-05-28 00:33:41] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-28 00:33:41] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:33:41] [INFO ] Invariant cache hit.
[2024-05-28 00:33:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:33:42] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-05-28 00:33:42] [INFO ] Redundant transitions in 2 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-28 00:33:42] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:33:42] [INFO ] Invariant cache hit.
[2024-05-28 00:33:42] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:33:44] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:33:45] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:33:45] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:33:45] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:33:45] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-28 00:33:46] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:33:49] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:33:50] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:33:50] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:33:51] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:33:51] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-28 00:33:51] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:33:53] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 331/452 variables, 121/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 43/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 329 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:34:15] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:34:16] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:34:17] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-28 00:34:17] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:34:17] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:34:17] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 331/452 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 498/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 833 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30020 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 27/27 constraints]
After SMT, in 60939ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61719 ms. Remains : 121/121 places, 504/504 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 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 :[(NOT p0), (NOT p0)]
RANDOM walk for 436 steps (0 resets) in 8 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 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 177 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 706 reset in 332 ms.
Product exploration explored 100000 steps with 740 reset in 330 ms.
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 504/504 transitions.
Applied a total of 0 rules in 16 ms. Remains 121 /121 variables (removed 0) and now considering 504/504 (removed 0) transitions.
[2024-05-28 00:34:44] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:34:44] [INFO ] Invariant cache hit.
[2024-05-28 00:34:45] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-28 00:34:45] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:34:45] [INFO ] Invariant cache hit.
[2024-05-28 00:34:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:34:45] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-28 00:34:45] [INFO ] Redundant transitions in 3 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-28 00:34:45] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:34:45] [INFO ] Invariant cache hit.
[2024-05-28 00:34:45] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:34:48] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:34:49] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 4 ms to minimize.
[2024-05-28 00:34:50] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-28 00:34:50] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:34:50] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:34:50] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:34:52] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:34:53] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:34:53] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:34:55] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-05-28 00:34:55] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:34:55] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:34:57] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 331/452 variables, 121/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 43/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 329 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:35:18] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-28 00:35:19] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:35:20] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2024-05-28 00:35:20] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:35:20] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:35:20] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 331/452 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 498/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 833 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 27/27 constraints]
After SMT, in 60983ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60989ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61745 ms. Remains : 121/121 places, 504/504 transitions.
Treatment of property SafeBus-PT-06-LTLCardinality-09 finished in 127434 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)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:35:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:35:46] [INFO ] Computed 29 invariants in 3 ms
[2024-05-28 00:35:46] [INFO ] Implicit Places using invariants in 246 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 249 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 132 transition count 410
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 410
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 121 transition count 524
Applied a total of 22 rules in 27 ms. Remains 121 /132 variables (removed 11) and now considering 524/415 (removed -109) transitions.
[2024-05-28 00:35:46] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
// Phase 1: matrix 351 rows 121 cols
[2024-05-28 00:35:46] [INFO ] Computed 23 invariants in 4 ms
[2024-05-28 00:35:47] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-28 00:35:47] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:35:47] [INFO ] Invariant cache hit.
[2024-05-28 00:35:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:35:47] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/138 places, 524/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1006 ms. Remains : 121/138 places, 524/415 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 9933 reset in 276 ms.
Product exploration explored 100000 steps with 9825 reset in 277 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-05-28 00:35:48] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:35:48] [INFO ] Invariant cache hit.
[2024-05-28 00:35:48] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-28 00:35:48] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 42 ms returned sat
[2024-05-28 00:35:49] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-28 00:35:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:35:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-28 00:35:49] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 11 ms returned sat
[2024-05-28 00:35:49] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-28 00:35:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:35:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 28 ms returned sat
[2024-05-28 00:35:49] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:35:49] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 00:35:49] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 00:35:49] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-28 00:35:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 277 ms
[2024-05-28 00:35:49] [INFO ] Computed and/alt/rep : 37/72/37 causal constraints (skipped 308 transitions) in 45 ms.
[2024-05-28 00:35:49] [INFO ] Added : 5 causal constraints over 3 iterations in 136 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 524/524 transitions.
Applied a total of 0 rules in 22 ms. Remains 121 /121 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-05-28 00:35:49] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:35:49] [INFO ] Invariant cache hit.
[2024-05-28 00:35:50] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 00:35:50] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:35:50] [INFO ] Invariant cache hit.
[2024-05-28 00:35:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:35:50] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-28 00:35:50] [INFO ] Redundant transitions in 5 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-28 00:35:50] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:35:50] [INFO ] Invariant cache hit.
[2024-05-28 00:35:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-28 00:35:53] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:35:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-28 00:35:53] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:35:53] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:35:54] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:35:54] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-28 00:35:54] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:35:54] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:35:54] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:35:54] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:35:55] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:35:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-28 00:35:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:35:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-28 00:35:58] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:35:58] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 00:35:58] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-28 00:35:59] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/291 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 334 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30028 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-28 00:36:23] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 518/853 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 853 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30016 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 27/27 constraints]
After SMT, in 61173ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 61180ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61939 ms. Remains : 121/121 places, 524/524 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-28 00:36:52] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:36:52] [INFO ] Invariant cache hit.
[2024-05-28 00:36:52] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-28 00:36:52] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 30 ms returned sat
[2024-05-28 00:36:52] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-28 00:36:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:36:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-28 00:36:52] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 10 ms returned sat
[2024-05-28 00:36:52] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-28 00:36:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:36:52] [INFO ] [Nat]Added 43 Read/Feed constraints in 28 ms returned sat
[2024-05-28 00:36:52] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:36:52] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2024-05-28 00:36:53] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:36:53] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 00:36:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 321 ms
[2024-05-28 00:36:53] [INFO ] Computed and/alt/rep : 37/72/37 causal constraints (skipped 308 transitions) in 131 ms.
[2024-05-28 00:36:53] [INFO ] Added : 5 causal constraints over 3 iterations in 264 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9920 reset in 264 ms.
Product exploration explored 100000 steps with 9800 reset in 279 ms.
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 524/524 transitions.
Applied a total of 0 rules in 15 ms. Remains 121 /121 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2024-05-28 00:36:54] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:36:54] [INFO ] Invariant cache hit.
[2024-05-28 00:36:54] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-28 00:36:54] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:36:54] [INFO ] Invariant cache hit.
[2024-05-28 00:36:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:36:55] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2024-05-28 00:36:55] [INFO ] Redundant transitions in 3 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-28 00:36:55] [INFO ] Flow matrix only has 351 transitions (discarded 173 similar events)
[2024-05-28 00:36:55] [INFO ] Invariant cache hit.
[2024-05-28 00:36:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-28 00:36:58] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-28 00:36:58] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:36:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2024-05-28 00:36:58] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:37:03] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/291 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 334 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30023 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/144 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-28 00:37:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 351/472 variables, 121/292 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 43/335 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 518/853 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 853 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30019 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 27/27 constraints]
After SMT, in 61307ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 61312ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62493 ms. Remains : 121/121 places, 524/524 transitions.
Treatment of property SafeBus-PT-06-LTLCardinality-10 finished in 129958 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)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:37:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:37:56] [INFO ] Computed 29 invariants in 4 ms
[2024-05-28 00:37:56] [INFO ] Implicit Places using invariants in 241 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 242 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 22 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-05-28 00:37:56] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-28 00:37:56] [INFO ] Computed 23 invariants in 5 ms
[2024-05-28 00:37:57] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-28 00:37:57] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-28 00:37:57] [INFO ] Invariant cache hit.
[2024-05-28 00:37:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:37:57] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 948 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 349 ms.
Stack based approach found an accepted trace after 245 steps with 0 reset with depth 246 and stack size 246 in 2 ms.
FORMULA SafeBus-PT-06-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-11 finished in 1366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-28 00:37:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-28 00:37:57] [INFO ] Computed 29 invariants in 5 ms
[2024-05-28 00:37:58] [INFO ] Implicit Places using invariants in 254 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 255 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 121 transition count 504
Applied a total of 22 rules in 20 ms. Remains 121 /132 variables (removed 11) and now considering 504/415 (removed -89) transitions.
[2024-05-28 00:37:58] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
// Phase 1: matrix 331 rows 121 cols
[2024-05-28 00:37:58] [INFO ] Computed 23 invariants in 5 ms
[2024-05-28 00:37:58] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-28 00:37:58] [INFO ] Flow matrix only has 331 transitions (discarded 173 similar events)
[2024-05-28 00:37:58] [INFO ] Invariant cache hit.
[2024-05-28 00:37:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 00:37:58] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/138 places, 504/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1028 ms. Remains : 121/138 places, 504/415 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 313 reset in 318 ms.
Stack based approach found an accepted trace after 219 steps with 3 reset with depth 103 and stack size 103 in 1 ms.
FORMULA SafeBus-PT-06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLCardinality-12 finished in 1406 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)))'
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)))'
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)))'
[2024-05-28 00:37:59] [INFO ] Flatten gal took : 30 ms
[2024-05-28 00:37:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 00:37:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 5 ms.
Total runtime 638528 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 415
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.000s]

SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2217
MODEL NAME: /home/mcc/execution/413/model
138 places, 415 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SafeBus-PT-06-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-PT-06-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-PT-06-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716856871468

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SafeBus-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078400419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;