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-171679078300363.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-COL-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078300363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-COL-06-LTLCardinality-00
FORMULA_NAME SafeBus-COL-06-LTLCardinality-01
FORMULA_NAME SafeBus-COL-06-LTLCardinality-02
FORMULA_NAME SafeBus-COL-06-LTLCardinality-03
FORMULA_NAME SafeBus-COL-06-LTLCardinality-04
FORMULA_NAME SafeBus-COL-06-LTLCardinality-05
FORMULA_NAME SafeBus-COL-06-LTLCardinality-06
FORMULA_NAME SafeBus-COL-06-LTLCardinality-07
FORMULA_NAME SafeBus-COL-06-LTLCardinality-08
FORMULA_NAME SafeBus-COL-06-LTLCardinality-09
FORMULA_NAME SafeBus-COL-06-LTLCardinality-10
FORMULA_NAME SafeBus-COL-06-LTLCardinality-11
FORMULA_NAME SafeBus-COL-06-LTLCardinality-12
FORMULA_NAME SafeBus-COL-06-LTLCardinality-13
FORMULA_NAME SafeBus-COL-06-LTLCardinality-14
FORMULA_NAME SafeBus-COL-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716839931092

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 19:58:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 19:58:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 19:58:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 19:58:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 19:58:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2024-05-27 19:58:52] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 19:58:52] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 19:58:53] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 19:58:53] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA SafeBus-COL-06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-COL-06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (8 resets) in 1468 ms. (27 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 310 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 19:58:54] [INFO ] Computed 7 invariants in 4 ms
[2024-05-27 19:58:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 15/31 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA SafeBus-COL-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 19:58:54] [INFO ] Flatten gal took : 14 ms
[2024-05-27 19:58:54] [INFO ] Flatten gal took : 4 ms
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2024-05-27 19:58:54] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 27 ms.
[2024-05-27 19:58:54] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Support contains 118 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 8 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 19:58:54] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 19:58:54] [INFO ] Computed 29 invariants in 11 ms
[2024-05-27 19:58:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 19:58:54] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 19:58:54] [INFO ] Invariant cache hit.
[2024-05-27 19:58:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 19:58:54] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-27 19:58:54] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 19:58:54] [INFO ] Invariant cache hit.
[2024-05-27 19:58:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 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 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:58:57] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 12 ms to minimize.
[2024-05-27 19:58:57] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 5 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/49 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-27 19:59:02] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-27 19:59:02] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-27 19:59:02] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/58 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:04] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:05] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-27 19:59:06] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:07] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/62 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 4 ms to minimize.
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 4 ms to minimize.
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 6/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:12] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 3 ms to minimize.
[2024-05-27 19:59:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-27 19:59:12] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 3/71 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:14] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 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 253 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 43/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/662 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:33] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-27 19:59:33] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-27 19:59:38] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 19:59:38] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-27 19:59:38] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 5/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/667 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 667 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 48/48 constraints]
After SMT, in 60689ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60701ms
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 2 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 61055 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 118 out of 138 places after structural reductions.
[2024-05-27 19:59:55] [INFO ] Flatten gal took : 46 ms
[2024-05-27 19:59:55] [INFO ] Flatten gal took : 40 ms
[2024-05-27 19:59:55] [INFO ] Input system was already deterministic with 415 transitions.
Support contains 112 out of 138 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
[2024-05-27 19:59:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:56] [INFO ] Invariant cache hit.
[2024-05-27 19:59:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/90 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/134 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 19:59:56] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-27 19:59:56] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 136/380 variables, and 30 constraints, problems are : Problem set: 1 solved, 0 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 190ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
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 36 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 19:59:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:56] [INFO ] Invariant cache hit.
[2024-05-27 19:59:56] [INFO ] Implicit Places using invariants in 158 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 162 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 221 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-06-LTLCardinality-00 finished in 412 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 p2))))'
Support contains 13 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 13 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 19:59:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:56] [INFO ] Invariant cache hit.
[2024-05-27 19:59:57] [INFO ] Implicit Places using invariants in 152 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 155 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 5 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 173 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLCardinality-02 finished in 835 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 6 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 19:59:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:57] [INFO ] Invariant cache hit.
[2024-05-27 19:59:57] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-27 19:59:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:57] [INFO ] Invariant cache hit.
[2024-05-27 19:59:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 19:59:58] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 19:59:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:58] [INFO ] Invariant cache hit.
[2024-05-27 19:59:58] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 19:59:59] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-27 20:00:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:00:00] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:00:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 7 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:00:03] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:00:03] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:07] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25994 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:32] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 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 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56443ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56449ms
Finished structural reductions in LTL mode , in 1 iterations and 56996 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 188 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 15 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-COL-06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLCardinality-03 finished in 57479 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 18 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:00:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:00:55] [INFO ] Invariant cache hit.
[2024-05-27 20:00:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 20:00:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:00:55] [INFO ] Invariant cache hit.
[2024-05-27 20:00:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:00:55] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-05-27 20:00:55] [INFO ] Redundant transitions in 27 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:00:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:00:55] [INFO ] Invariant cache hit.
[2024-05-27 20:00:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:57] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:57] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:00:58] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:01:02] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:02] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:04] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25251 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:28] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 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 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55663ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56244 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-04
Product exploration explored 100000 steps with 1525 reset in 295 ms.
Stack based approach found an accepted trace after 1850 steps with 27 reset with depth 61 and stack size 61 in 7 ms.
FORMULA SafeBus-COL-06-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLCardinality-04 finished in 56657 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 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:01:51] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:51] [INFO ] Invariant cache hit.
[2024-05-27 20:01:52] [INFO ] Implicit Places using invariants in 154 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 166 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 2 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 171 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 157 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 27 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-COL-06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLCardinality-06 finished in 595 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 19 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:01:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:52] [INFO ] Invariant cache hit.
[2024-05-27 20:01:52] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 20:01:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:52] [INFO ] Invariant cache hit.
[2024-05-27 20:01:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:01:53] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-27 20:01:53] [INFO ] Redundant transitions in 10 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:01:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:53] [INFO ] Invariant cache hit.
[2024-05-27 20:01:53] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:54] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-27 20:01:54] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:01:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:55] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:01:55] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:55] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:55] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:01:56] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:01:57] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:57] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:57] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:01:57] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:01:57] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:01:57] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:01] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25937 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:26] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 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 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56365ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56370ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56925 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-06-LTLCardinality-07 finished in 57066 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 U (p1||G(p0)))))'
Support contains 73 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 20 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:02:49] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:49] [INFO ] Invariant cache hit.
[2024-05-27 20:02:49] [INFO ] Implicit Places using invariants in 115 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 118 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
Applied a total of 12 rules in 21 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-05-27 20:02:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-27 20:02:49] [INFO ] Computed 23 invariants in 8 ms
[2024-05-27 20:02:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 20:02:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:02:49] [INFO ] Invariant cache hit.
[2024-05-27 20:02:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:02:50] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 484 ms. Remains : 126/138 places, 409/415 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-11
Product exploration explored 100000 steps with 12495 reset in 437 ms.
Stack based approach found an accepted trace after 20479 steps with 2585 reset with depth 57 and stack size 57 in 106 ms.
FORMULA SafeBus-COL-06-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLCardinality-11 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(p1))) U X(X(p2)))))'
Support contains 49 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-27 20:02:50] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:02:50] [INFO ] Computed 29 invariants in 3 ms
[2024-05-27 20:02:50] [INFO ] Implicit Places using invariants in 113 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 115 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 1 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 118 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : SafeBus-COL-06-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 188 ms.
Product exploration explored 100000 steps with 25000 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 944 steps (0 resets) in 11 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 6 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:02:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 20:02:52] [INFO ] Computed 23 invariants in 7 ms
[2024-05-27 20:02:52] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 20:02:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:52] [INFO ] Invariant cache hit.
[2024-05-27 20:02:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:02:52] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 20:02:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:52] [INFO ] Invariant cache hit.
[2024-05-27 20:02:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:54] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-27 20:02:54] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:02:55] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:02:55] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:02:55] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:02:55] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:02:55] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 11 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:02:56] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:02:57] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:01] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:03:01] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:03:01] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:03:01] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:03:01] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:03:01] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:02] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:03:03] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:04] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/374 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 43/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:15] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 243 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/374 variables, 132/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 43/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 409/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 652 constraints, problems are : Problem set: 0 solved, 409 unsolved in 28787 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
After SMT, in 59207ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 59215ms
Finished structural reductions in LTL mode , in 1 iterations and 59579 ms. Remains : 132/132 places, 415/415 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 : [p2]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
RANDOM walk for 30814 steps (6 resets) in 192 ms. (159 steps per ms) remains 0/1 properties
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 25000 reset in 156 ms.
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 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 415
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 132 transition count 415
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -144
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 132 transition count 559
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 12 rules in 38 ms. Remains 132 /132 variables (removed 0) and now considering 559/415 (removed -144) transitions.
[2024-05-27 20:03:53] [INFO ] Redundant transitions in 4 ms returned []
Running 553 sub problems to find dead transitions.
[2024-05-27 20:03:53] [INFO ] Flow matrix only has 386 transitions (discarded 173 similar events)
// Phase 1: matrix 386 rows 132 cols
[2024-05-27 20:03:53] [INFO ] Computed 23 invariants in 3 ms
[2024-05-27 20:03:53] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-27 20:03:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 5 ms to minimize.
[2024-05-27 20:03:56] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:03:56] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:03:57] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:03:57] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:03:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:03:57] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:03:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:03:59] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-27 20:03:59] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
[2024-05-27 20:03:59] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2024-05-27 20:03:59] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
[2024-05-27 20:03:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 35 solved, 518 unsolved
[2024-05-27 20:04:00] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:04:01] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-05-27 20:04:01] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:04:01] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-05-27 20:04:01] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:04:01] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:04:01] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 7/50 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2024-05-27 20:04:04] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-27 20:04:04] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/52 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2024-05-27 20:04:06] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:04:06] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/54 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2024-05-27 20:04:08] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/55 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 8 (OVERLAPS) 386/518 variables, 132/187 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 43/230 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/518 variables, 0/230 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 11 (OVERLAPS) 0/518 variables, 0/230 constraints. Problems are: Problem set: 36 solved, 517 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 230 constraints, problems are : Problem set: 36 solved, 517 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 36 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 3/3 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 3/6 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 32/38 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 12/132 variables, 7/45 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 10/55 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 7 (OVERLAPS) 386/518 variables, 132/187 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 43/230 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 517/747 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/518 variables, 0/747 constraints. Problems are: Problem set: 36 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 747 constraints, problems are : Problem set: 36 solved, 517 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/553 constraints, Known Traps: 32/32 constraints]
After SMT, in 61751ms problems are : Problem set: 36 solved, 517 unsolved
Search for dead transitions found 36 dead transitions in 61759ms
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 SI_LTL mode, iteration 1 : 132/132 places, 523/415 transitions.
Graph (complete) has 1627 edges and 132 vertex of which 120 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 120 /132 variables (removed 12) and now considering 523/523 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/132 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61867 ms. Remains : 120/132 places, 523/415 transitions.
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:04:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 20:04:55] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 20:04:55] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-27 20:04:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:04:55] [INFO ] Invariant cache hit.
[2024-05-27 20:04:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:04:55] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 20:04:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:04:55] [INFO ] Invariant cache hit.
[2024-05-27 20:04:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:57] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:04:57] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:04:58] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:04:58] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:04:58] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:04:58] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:04:58] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:04:59] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:05:00] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:05:00] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:05:00] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:05:00] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:05:00] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:05:01] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-27 20:05:01] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:05:01] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:05:01] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:05:02] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:05:04] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:05:04] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:05:05] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-27 20:05:05] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:05:05] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:05:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:05:06] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:05:07] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:05:08] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/374 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 43/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:05:19] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 243 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/374 variables, 132/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 43/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 409/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 652 constraints, problems are : Problem set: 0 solved, 409 unsolved in 29047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
After SMT, in 59433ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 59438ms
Finished structural reductions in LTL mode , in 1 iterations and 59969 ms. Remains : 132/132 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLCardinality-12 finished in 184759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(p1))) U X(X(p2)))))'
[2024-05-27 20:05:55] [INFO ] Flatten gal took : 33 ms
[2024-05-27 20:05:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-27 20:05:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 6 ms.
Total runtime 423330 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/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.014s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/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: 1756
MODEL NAME: /home/mcc/execution/411/model
138 places, 415 transitions.

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..
No place bound informations found.
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-COL-06-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716840547634

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-COL-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-COL-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-171679078300363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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