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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716840600207

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:10:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:10:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:10:01] [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 20:10:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:10:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 599 ms
[2024-05-27 20:10:02] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-05-27 20:10:02] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 20:10:02] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2024-05-27 20:10:02] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA SafeBus-COL-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (8 resets) in 1399 ms. (28 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40002 steps (8 resets) in 359 ms. (111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 20:10:03] [INFO ] Computed 7 invariants in 6 ms
[2024-05-27 20:10:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 11/31 variables, and 5 constraints, problems are : Problem set: 7 solved, 0 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/17 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 350ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
FORMULA SafeBus-COL-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:10:03] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-27 20:10:03] [INFO ] Flatten gal took : 14 ms
FORMULA SafeBus-COL-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:10:03] [INFO ] Flatten gal took : 4 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-05-27 20:10:03] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 49 ms.
[2024-05-27 20:10:03] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 20 places and 20 transitions.
Support contains 144 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 43 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 20:10:03] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:10:03] [INFO ] Computed 45 invariants in 35 ms
[2024-05-27 20:10:04] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-27 20:10:04] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:10:04] [INFO ] Invariant cache hit.
[2024-05-27 20:10:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:10:05] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2024-05-27 20:10:05] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:10:05] [INFO ] Invariant cache hit.
[2024-05-27 20:10:05] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:10:19] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 22 ms to minimize.
[2024-05-27 20:10:19] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 3 ms to minimize.
[2024-05-27 20:10:19] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
[2024-05-27 20:10:19] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 2 ms to minimize.
[2024-05-27 20:10:19] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-27 20:10:29] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 2 ms to minimize.
[2024-05-27 20:10:30] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 2 ms to minimize.
[2024-05-27 20:10:30] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 2 ms to minimize.
[2024-05-27 20:10:30] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:10:30] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:10:30] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:10:31] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 2 ms to minimize.
[2024-05-27 20:10:31] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 2 ms to minimize.
[2024-05-27 20:10:31] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:10:32] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:10:51] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-27 20:10:51] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-27 20:10:51] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2024-05-27 20:10:51] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-05-27 20:10:52] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-27 20:10:52] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2024-05-27 20:10:52] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-27 20:10:52] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 20:10:52] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:10:53] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 3 ms to minimize.
[2024-05-27 20:10:55] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 2 ms to minimize.
[2024-05-27 20:10:55] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 2 ms to minimize.
[2024-05-27 20:10:56] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:10:56] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 2 ms to minimize.
[2024-05-27 20:10:56] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 2 ms to minimize.
[2024-05-27 20:10:56] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:10:57] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:10:57] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 1 ms to minimize.
[2024-05-27 20:10:57] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 2 ms to minimize.
[2024-05-27 20:10:57] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/85 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:11:07] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:11:07] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2024-05-27 20:11:07] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 2 ms to minimize.
[2024-05-27 20:11:09] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-05-27 20:11:09] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-05-27 20:11:09] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 91 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 46/46 constraints]
After SMT, in 64790ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64813ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 29 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66564 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 144 out of 306 places after structural reductions.
[2024-05-27 20:11:10] [INFO ] Flatten gal took : 240 ms
[2024-05-27 20:11:10] [INFO ] Flatten gal took : 126 ms
[2024-05-27 20:11:10] [INFO ] Input system was already deterministic with 1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 1445 ms. (27 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
[2024-05-27 20:11:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:11:11] [INFO ] Invariant cache hit.
[2024-05-27 20:11:11] [INFO ] State equation strengthened by 111 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 155/247 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 305/948 variables, and 44 constraints, problems are : Problem set: 3 solved, 0 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 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' '!(F(G(p0)))'
Support contains 110 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 185 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:11:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:11:12] [INFO ] Invariant cache hit.
[2024-05-27 20:11:12] [INFO ] Implicit Places using invariants in 390 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 396 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 393 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 975 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 844 ms.
Product exploration explored 100000 steps with 0 reset in 759 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 70 steps (0 resets) in 10 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2024-05-27 20:11:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 20:11:15] [INFO ] Computed 35 invariants in 13 ms
[2024-05-27 20:11:15] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 20:11:15] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 28 ms returned sat
[2024-05-27 20:11:16] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-27 20:11:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:11:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 20:11:17] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 22 ms returned sat
[2024-05-27 20:11:17] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-05-27 20:11:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:11:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 102 ms returned sat
[2024-05-27 20:11:17] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 91 ms.
[2024-05-27 20:11:18] [INFO ] Added : 0 causal constraints over 0 iterations in 164 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 92 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:11:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:11:18] [INFO ] Invariant cache hit.
[2024-05-27 20:11:18] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-27 20:11:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:11:18] [INFO ] Invariant cache hit.
[2024-05-27 20:11:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:11:19] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2024-05-27 20:11:20] [INFO ] Redundant transitions in 114 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:11:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:11:20] [INFO ] Invariant cache hit.
[2024-05-27 20:11:20] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:11:32] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 2 ms to minimize.
[2024-05-27 20:11:33] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:11:40] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-27 20:11:40] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 2 ms to minimize.
[2024-05-27 20:11:40] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 3 ms to minimize.
[2024-05-27 20:11:40] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-05-27 20:11:41] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 2 ms to minimize.
[2024-05-27 20:11:41] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:11:42] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2024-05-27 20:11:42] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:11:42] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 7 ms to minimize.
[2024-05-27 20:11:42] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:11:45] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 2 ms to minimize.
[2024-05-27 20:11:45] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2024-05-27 20:11:45] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 2 ms to minimize.
[2024-05-27 20:11:46] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 2 ms to minimize.
[2024-05-27 20:11:46] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:11:46] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-05-27 20:11:46] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 1 ms to minimize.
[2024-05-27 20:11:47] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:11:55] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 2 ms to minimize.
[2024-05-27 20:11:55] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 2 ms to minimize.
[2024-05-27 20:11:55] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 2 ms to minimize.
[2024-05-27 20:12:05] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-05-27 20:12:05] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2024-05-27 20:12:06] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2024-05-27 20:12:06] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2024-05-27 20:12:08] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-27 20:12:09] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:12:19] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 2 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63708ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63722ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65753 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 81 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-05-27 20:12:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:12:24] [INFO ] Invariant cache hit.
[2024-05-27 20:12:24] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 20:12:24] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 79 ms returned sat
[2024-05-27 20:12:25] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2024-05-27 20:12:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 20:12:26] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 44 ms returned sat
[2024-05-27 20:12:26] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-27 20:12:26] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:12:26] [INFO ] [Nat]Added 111 Read/Feed constraints in 110 ms returned sat
[2024-05-27 20:12:26] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 59 ms.
[2024-05-27 20:12:26] [INFO ] Added : 1 causal constraints over 1 iterations in 151 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 687 ms.
Product exploration explored 100000 steps with 0 reset in 723 ms.
Support contains 110 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 88 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:12:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:12:28] [INFO ] Invariant cache hit.
[2024-05-27 20:12:28] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-27 20:12:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:12:28] [INFO ] Invariant cache hit.
[2024-05-27 20:12:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:12:30] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
[2024-05-27 20:12:30] [INFO ] Redundant transitions in 42 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:12:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:12:30] [INFO ] Invariant cache hit.
[2024-05-27 20:12:30] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:12:41] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 2 ms to minimize.
[2024-05-27 20:12:42] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:12:49] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 20:12:49] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 2 ms to minimize.
[2024-05-27 20:12:50] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:12:50] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 2 ms to minimize.
[2024-05-27 20:12:50] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:12:51] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2024-05-27 20:12:51] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2024-05-27 20:12:51] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 2 ms to minimize.
[2024-05-27 20:12:51] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 1 ms to minimize.
[2024-05-27 20:12:52] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
[2024-05-27 20:12:54] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:12:54] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 1 ms to minimize.
[2024-05-27 20:12:55] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:12:55] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 2 ms to minimize.
[2024-05-27 20:12:55] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 2 ms to minimize.
[2024-05-27 20:12:55] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2024-05-27 20:12:55] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 1 ms to minimize.
[2024-05-27 20:12:56] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
(s157 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:13:04] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 2 ms to minimize.
[2024-05-27 20:13:05] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 2 ms to minimize.
[2024-05-27 20:13:05] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 1 ms to minimize.
[2024-05-27 20:13:13] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 2 ms to minimize.
[2024-05-27 20:13:13] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:13:14] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 2 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:13:29] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:13:30] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 2 ms to minimize.
[2024-05-27 20:13:30] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-27 20:13:30] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-05-27 20:13:31] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63369ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65210 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLCardinality-00 finished in 141768 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(G(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:13:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:13:33] [INFO ] Computed 45 invariants in 10 ms
[2024-05-27 20:13:34] [INFO ] Implicit Places using invariants in 516 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 520 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 533 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-02 finished in 661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 99 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:13:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:13:34] [INFO ] Invariant cache hit.
[2024-05-27 20:13:34] [INFO ] Implicit Places using invariants in 394 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 396 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 89 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 6458 reset in 364 ms.
Product exploration explored 100000 steps with 6468 reset in 346 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 61 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:13:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 20:13:36] [INFO ] Computed 35 invariants in 10 ms
[2024-05-27 20:13:36] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 20:13:36] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 44 ms returned sat
[2024-05-27 20:13:37] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-27 20:13:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:13:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-27 20:13:37] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 22 ms returned sat
[2024-05-27 20:13:38] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2024-05-27 20:13:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:13:39] [INFO ] [Nat]Added 111 Read/Feed constraints in 754 ms returned sat
[2024-05-27 20:13:39] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 57 ms.
[2024-05-27 20:13:39] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 88 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:13:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:13:39] [INFO ] Invariant cache hit.
[2024-05-27 20:13:39] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-27 20:13:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:13:39] [INFO ] Invariant cache hit.
[2024-05-27 20:13:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:13:41] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-27 20:13:41] [INFO ] Redundant transitions in 31 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:13:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:13:41] [INFO ] Invariant cache hit.
[2024-05-27 20:13:41] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:13:52] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 3 ms to minimize.
[2024-05-27 20:13:53] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2024-05-27 20:14:00] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:14:00] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 2 ms to minimize.
[2024-05-27 20:14:01] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 2 ms to minimize.
[2024-05-27 20:14:01] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2024-05-27 20:14:01] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 2 ms to minimize.
[2024-05-27 20:14:02] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2024-05-27 20:14:02] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:14:03] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:14:03] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:14:03] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2024-05-27 20:14:06] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 3 ms to minimize.
[2024-05-27 20:14:06] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 2 ms to minimize.
[2024-05-27 20:14:06] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:14:06] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:14:06] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 1 ms to minimize.
[2024-05-27 20:14:07] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 2 ms to minimize.
[2024-05-27 20:14:07] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-27 20:14:07] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:14:16] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:14:16] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 2 ms to minimize.
[2024-05-27 20:14:16] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 2 ms to minimize.
[2024-05-27 20:14:25] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:14:25] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:14:25] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2024-05-27 20:14:26] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-05-27 20:14:27] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 2 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:14:40] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2024-05-27 20:14:41] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 2 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 1 ms to minimize.
[2024-05-27 20:14:42] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63435ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63448ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65578 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 58 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:14:45] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:14:45] [INFO ] Invariant cache hit.
[2024-05-27 20:14:45] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 20:14:45] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 24 ms returned sat
[2024-05-27 20:14:46] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2024-05-27 20:14:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 20:14:46] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 47 ms returned sat
[2024-05-27 20:14:47] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2024-05-27 20:14:47] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:14:47] [INFO ] [Nat]Added 111 Read/Feed constraints in 89 ms returned sat
[2024-05-27 20:14:47] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:14:47] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:14:47] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:14:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 321 ms
[2024-05-27 20:14:47] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 47 ms.
[2024-05-27 20:14:47] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6332 reset in 308 ms.
Product exploration explored 100000 steps with 358 reset in 558 ms.
Support contains 11 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 82 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:14:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:14:48] [INFO ] Invariant cache hit.
[2024-05-27 20:14:49] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-27 20:14:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:14:49] [INFO ] Invariant cache hit.
[2024-05-27 20:14:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:14:50] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2024-05-27 20:14:50] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:14:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:14:50] [INFO ] Invariant cache hit.
[2024-05-27 20:14:50] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:15:02] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:15:03] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2024-05-27 20:15:11] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:15:11] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2024-05-27 20:15:11] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:15:11] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:15:11] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 2 ms to minimize.
[2024-05-27 20:15:12] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-05-27 20:15:13] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2024-05-27 20:15:13] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 1 ms to minimize.
[2024-05-27 20:15:13] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-05-27 20:15:13] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 1 ms to minimize.
[2024-05-27 20:15:16] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 1 ms to minimize.
[2024-05-27 20:15:16] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 2 ms to minimize.
[2024-05-27 20:15:16] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 2 ms to minimize.
[2024-05-27 20:15:17] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2024-05-27 20:15:17] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:15:17] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 1 ms to minimize.
[2024-05-27 20:15:17] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2024-05-27 20:15:17] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:15:25] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:15:26] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:15:26] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2024-05-27 20:15:34] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:15:35] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2024-05-27 20:15:35] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:15:36] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 20:15:36] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:15:36] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2024-05-27 20:15:36] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-27 20:15:40] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:15:40] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:15:40] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2024-05-27 20:15:40] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:15:50] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 2 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 1 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 41 places in 181 ms of which 2 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-27 20:15:52] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63812ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63826ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65876 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLCardinality-03 finished in 140218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:15:54] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:15:54] [INFO ] Computed 45 invariants in 4 ms
[2024-05-27 20:15:54] [INFO ] Implicit Places using invariants in 366 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 367 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 377 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-04 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 83 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:15:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:15:55] [INFO ] Invariant cache hit.
[2024-05-27 20:15:55] [INFO ] Implicit Places using invariants in 409 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 415 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 92 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2024-05-27 20:15:55] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2024-05-27 20:15:55] [INFO ] Computed 35 invariants in 11 ms
[2024-05-27 20:15:56] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-27 20:15:56] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2024-05-27 20:15:56] [INFO ] Invariant cache hit.
[2024-05-27 20:15:56] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:15:57] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2611 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 467 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 1 ms.
FORMULA SafeBus-COL-10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-07 finished in 3126 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 U (G(p0)||(p0&&(G(p1)||(p1&&F(!p2)))))))))'
Support contains 110 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:15:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:15:58] [INFO ] Computed 45 invariants in 4 ms
[2024-05-27 20:15:58] [INFO ] Implicit Places using invariants in 361 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 363 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 379 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Product exploration explored 100000 steps with 50000 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 116 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLCardinality-10 finished in 1520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 121 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:15:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:15:59] [INFO ] Invariant cache hit.
[2024-05-27 20:16:00] [INFO ] Implicit Places using invariants in 421 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 423 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 114 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 659 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-13
Product exploration explored 100000 steps with 5202 reset in 370 ms.
Product exploration explored 100000 steps with 5241 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-05-27 20:16:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 20:16:01] [INFO ] Computed 35 invariants in 8 ms
[2024-05-27 20:16:02] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-27 20:16:02] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 29 ms returned sat
[2024-05-27 20:16:02] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2024-05-27 20:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-27 20:16:03] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 171 ms returned sat
[2024-05-27 20:16:03] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2024-05-27 20:16:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:16:03] [INFO ] [Nat]Added 111 Read/Feed constraints in 168 ms returned sat
[2024-05-27 20:16:03] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 51 ms.
[2024-05-27 20:16:04] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 116 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:16:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:04] [INFO ] Invariant cache hit.
[2024-05-27 20:16:04] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-27 20:16:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:04] [INFO ] Invariant cache hit.
[2024-05-27 20:16:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:16:06] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2024-05-27 20:16:06] [INFO ] Redundant transitions in 20 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:16:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:06] [INFO ] Invariant cache hit.
[2024-05-27 20:16:06] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:16:17] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:16:18] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 2 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-05-27 20:16:27] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 2 ms to minimize.
[2024-05-27 20:16:27] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 2 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 3 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:16:31] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 1 ms to minimize.
[2024-05-27 20:16:31] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:16:31] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:16:31] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:16:32] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2024-05-27 20:16:32] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
[2024-05-27 20:16:32] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-05-27 20:16:32] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:16:40] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2024-05-27 20:16:40] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 2 ms to minimize.
[2024-05-27 20:16:41] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-27 20:16:49] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 2 ms to minimize.
[2024-05-27 20:16:49] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
[2024-05-27 20:16:49] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:16:54] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2024-05-27 20:16:54] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-27 20:16:54] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:16:54] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 3 ms to minimize.
[2024-05-27 20:16:54] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 3 ms to minimize.
[2024-05-27 20:16:54] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-27 20:16:55] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:16:55] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:17:05] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 2 ms to minimize.
[2024-05-27 20:17:06] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2024-05-27 20:17:06] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-27 20:17:06] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 2 ms to minimize.
[2024-05-27 20:17:06] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 63107ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65291 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 80 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-05-27 20:17:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:17:09] [INFO ] Invariant cache hit.
[2024-05-27 20:17:10] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 20:17:10] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 37 ms returned sat
[2024-05-27 20:17:11] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2024-05-27 20:17:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:17:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 20:17:11] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 17 ms returned sat
[2024-05-27 20:17:11] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-05-27 20:17:11] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:17:11] [INFO ] [Nat]Added 111 Read/Feed constraints in 112 ms returned sat
[2024-05-27 20:17:11] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 48 ms.
[2024-05-27 20:17:12] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5227 reset in 395 ms.
Stack based approach found an accepted trace after 52102 steps with 2721 reset with depth 123 and stack size 123 in 207 ms.
FORMULA SafeBus-COL-10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLCardinality-13 finished in 72970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p0)))'
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:17:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:17:12] [INFO ] Computed 45 invariants in 9 ms
[2024-05-27 20:17:13] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-27 20:17:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:17:13] [INFO ] Invariant cache hit.
[2024-05-27 20:17:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:17:14] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:17:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:17:14] [INFO ] Invariant cache hit.
[2024-05-27 20:17:14] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:17:26] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:17:26] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:17:27] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:17:27] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 1 ms to minimize.
[2024-05-27 20:17:27] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2024-05-27 20:17:27] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2024-05-27 20:17:27] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-27 20:17:27] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2024-05-27 20:17:36] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 2 ms to minimize.
[2024-05-27 20:17:36] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-05-27 20:17:37] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:17:37] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2024-05-27 20:17:37] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2024-05-27 20:17:37] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:17:38] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 2 ms to minimize.
[2024-05-27 20:17:38] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:17:38] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 65 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:17:59] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2024-05-27 20:18:00] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:18:01] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:18:03] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 2 ms to minimize.
[2024-05-27 20:18:04] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2024-05-27 20:18:04] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 2 ms to minimize.
[2024-05-27 20:18:04] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 2 ms to minimize.
[2024-05-27 20:18:04] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 2 ms to minimize.
[2024-05-27 20:18:05] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-27 20:18:05] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-05-27 20:18:05] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-05-27 20:18:05] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:18:17] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-27 20:18:17] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 84 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 39/39 constraints]
After SMT, in 63775ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 63791ms
Finished structural reductions in LTL mode , in 1 iterations and 66006 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLCardinality-15 finished in 66789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-27 20:18:19] [INFO ] Flatten gal took : 83 ms
[2024-05-27 20:18:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-27 20:18:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 27 ms.
Total runtime 498638 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-10

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: 306
TRANSITIONS: 1531
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.051s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 2029
MODEL NAME: /home/mcc/execution/411/model
306 places, 1531 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-COL-10"
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-10, 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-171679078300371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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