MCC'2024- Execution of r289-tajo-171654445800387

About the Execution of GreatSPN+red for PolyORBNT-COL-S05J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8718.556	3600000.00	11469011.00	257.90	FTTTFFF?TFFFFFTF	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445800387.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 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 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K 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 PolyORBNT-COL-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716877860354

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:31:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 06:31:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:31: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-28 06:31:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:31:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2024-05-28 06:31:02] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:31:02] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 06:31:02] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (3195 resets) in 2201 ms. (18 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4002 steps (155 resets) in 71 ms. (55 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (82 resets) in 97 ms. (40 steps per ms) remains 5/22 properties
BEST_FIRST walk for 4003 steps (98 resets) in 66 ms. (59 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4002 steps (89 resets) in 69 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4002 steps (102 resets) in 73 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4002 steps (124 resets) in 23 ms. (166 steps per ms) remains 5/5 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:31:03] [INFO ] Computed 13 invariants in 5 ms
[2024-05-28 06:31:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/43 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 7 (OVERLAPS) 3/47 variables, 3/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/85 variables, 47/60 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 1/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/86 variables, 1/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 4 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/39 variables, 2/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/42 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 47/86 variables, and 13 constraints, problems are : Problem set: 5 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:31:03] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 06:31:03] [INFO ] Flatten gal took : 19 ms
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:31:03] [INFO ] Flatten gal took : 5 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:31:03] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 51 ms.
[2024-05-28 06:31:03] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 11 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 577 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1314
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1314
Applied a total of 7 rules in 77 ms. Remains 903 /909 variables (removed 6) and now considering 1314/1315 (removed 1) transitions.
Running 1308 sub problems to find dead transitions.
[2024-05-28 06:31:03] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
// Phase 1: matrix 1310 rows 903 cols
[2024-05-28 06:31:04] [INFO ] Computed 137 invariants in 100 ms
[2024-05-28 06:31:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2213 variables, and 131 constraints, problems are : Problem set: 0 solved, 1308 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 0/0 constraints]
After SMT, in 43406ms problems are : Problem set: 0 solved, 1308 unsolved
Search for dead transitions found 0 dead transitions in 43430ms
[2024-05-28 06:31:47] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2024-05-28 06:31:47] [INFO ] Invariant cache hit.
[2024-05-28 06:31:47] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-28 06:31:47] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2024-05-28 06:31:47] [INFO ] Invariant cache hit.
[2024-05-28 06:31:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:31:49] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Running 1308 sub problems to find dead transitions.
[2024-05-28 06:31:49] [INFO ] Flow matrix only has 1310 transitions (discarded 4 similar events)
[2024-05-28 06:31:49] [INFO ] Invariant cache hit.
[2024-05-28 06:31:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1308 unsolved
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.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 0.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 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 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.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 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.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 0.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 78 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2213 variables, and 136 constraints, problems are : Problem set: 78 solved, 1230 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1308/1308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 78 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 78 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 78 solved, 1230 unsolved
[2024-05-28 06:32:49] [INFO ] Deduced a trap composed of 304 places in 409 ms of which 55 ms to minimize.
[2024-05-28 06:32:49] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2213 variables, and 138 constraints, problems are : Problem set: 78 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1308 constraints, Known Traps: 2/2 constraints]
After SMT, in 62940ms problems are : Problem set: 78 solved, 1230 unsolved
Search for dead transitions found 78 dead transitions in 62953ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1315 transitions.
Applied a total of 0 rules in 14 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108361 ms. Remains : 903/909 places, 1236/1315 transitions.
Support contains 577 out of 903 places after structural reductions.
[2024-05-28 06:32:52] [INFO ] Flatten gal took : 151 ms
[2024-05-28 06:32:52] [INFO ] Flatten gal took : 113 ms
[2024-05-28 06:32:52] [INFO ] Input system was already deterministic with 1236 transitions.
RANDOM walk for 40000 steps (2774 resets) in 584 ms. (68 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (440 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
[2024-05-28 06:32:53] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 06:32:53] [INFO ] Computed 137 invariants in 52 ms
[2024-05-28 06:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 793/854 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/854 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/888 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/890 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 901/2135 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 130/131 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 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' '!(X(X(F(p0))))'
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Applied a total of 0 rules in 23 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:32:53] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:32:53] [INFO ] Invariant cache hit.
[2024-05-28 06:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42680ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42691ms
[2024-05-28 06:33:36] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:33:36] [INFO ] Invariant cache hit.
[2024-05-28 06:33:37] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-28 06:33:37] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:33:37] [INFO ] Invariant cache hit.
[2024-05-28 06:33:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:33:41] [INFO ] Implicit Places using invariants and state equation in 4440 ms returned []
Implicit Place search using SMT with State Equation took 5353 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:33:41] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:33:41] [INFO ] Invariant cache hit.
[2024-05-28 06:33:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 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 0.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 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 1.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 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.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 3.0))
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 (/ 1.0 3.0))
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 (/ 1.0 3.0))
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 (/ 1.0 3.0))
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 (/ 1.0 3.0))
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 (/ 1.0 3.0))
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 (/ 2.0 3.0))
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 (/ 2.0 3.0))
(s731 0.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 (/ 2.0 3.0))
(s764 0.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 06:34:39] [INFO ] Deduced a trap composed of 304 places in 286 ms of which 5 ms to minimize.
[2024-05-28 06:34:40] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62397ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62420ms
Finished structural reductions in LTL mode , in 1 iterations and 110498 ms. Remains : 903/903 places, 1236/1236 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 549 ms.
Product exploration explored 100000 steps with 33333 reset in 395 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-01 finished in 111725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1) U (F((p2 U p3))&&p2)))'
Support contains 125 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Applied a total of 0 rules in 30 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:34:45] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:34:45] [INFO ] Invariant cache hit.
[2024-05-28 06:34:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42594ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42608ms
[2024-05-28 06:35:28] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:35:28] [INFO ] Invariant cache hit.
[2024-05-28 06:35:28] [INFO ] Implicit Places using invariants in 782 ms returned []
[2024-05-28 06:35:28] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:35:28] [INFO ] Invariant cache hit.
[2024-05-28 06:35:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:35:32] [INFO ] Implicit Places using invariants and state equation in 3707 ms returned []
Implicit Place search using SMT with State Equation took 4497 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:35:32] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:35:32] [INFO ] Invariant cache hit.
[2024-05-28 06:35:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
(s147 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 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 0.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 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 1.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 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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 06:36:29] [INFO ] Deduced a trap composed of 304 places in 298 ms of which 5 ms to minimize.
[2024-05-28 06:36:29] [INFO ] Deduced a trap composed of 12 places in 361 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62640ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62652ms
Finished structural reductions in LTL mode , in 1 iterations and 109792 ms. Remains : 903/903 places, 1236/1236 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-04 finished in 109933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 773 transition count 1106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 770 transition count 1103
Applied a total of 266 rules in 141 ms. Remains 770 /903 variables (removed 133) and now considering 1103/1236 (removed 133) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:36:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 06:36:35] [INFO ] Computed 137 invariants in 22 ms
[2024-05-28 06:36:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:36:48] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:36:48] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 8 ms to minimize.
[2024-05-28 06:36:48] [INFO ] Deduced a trap composed of 227 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:36:49] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:36:49] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:36:49] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:36:49] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:36:50] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:36:50] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:36:50] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:36:50] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:36:51] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:36:51] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:36:51] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:36:51] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:36:52] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:36:52] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:36:52] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:36:53] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 4 ms to minimize.
[2024-05-28 06:36:53] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:36:53] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:36:54] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:36:54] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:36:54] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:36:55] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:36:55] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:36:55] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:36:55] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:36:56] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:36:56] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 5 ms to minimize.
[2024-05-28 06:36:56] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:36:56] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:36:56] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:36:57] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:36:57] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
SMT process timed out in 22268ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22279ms
[2024-05-28 06:36:57] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:36:57] [INFO ] Invariant cache hit.
[2024-05-28 06:36:58] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-05-28 06:36:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:36:58] [INFO ] Invariant cache hit.
[2024-05-28 06:36:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:37:04] [INFO ] Implicit Places using invariants and state equation in 6029 ms returned []
Implicit Place search using SMT with State Equation took 6781 ms to find 0 implicit places.
[2024-05-28 06:37:04] [INFO ] Redundant transitions in 75 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:37:04] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:37:04] [INFO ] Invariant cache hit.
[2024-05-28 06:37:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:21] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:37:21] [INFO ] Deduced a trap composed of 254 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:21] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:37:21] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 6 ms to minimize.
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 242 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 5 ms to minimize.
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:23] [INFO ] Deduced a trap composed of 254 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:37:23] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 251 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 230 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 260 places in 227 ms of which 5 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:37:28] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:37:28] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.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 0.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 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 0.0)
(s99 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 200 places in 287 ms of which 5 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 200 places in 240 ms of which 5 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 200 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 200 places in 296 ms of which 4 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 200 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:49] [INFO ] Deduced a trap composed of 249 places in 282 ms of which 5 ms to minimize.
[2024-05-28 06:37:49] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 237 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 5 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 248 places in 255 ms of which 5 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 255 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 237 places in 214 ms of which 4 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 248 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 242 places in 209 ms of which 4 ms to minimize.
[2024-05-28 06:37:52] [INFO ] Deduced a trap composed of 236 places in 212 ms of which 4 ms to minimize.
[2024-05-28 06:37:52] [INFO ] Deduced a trap composed of 254 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:37:52] [INFO ] Deduced a trap composed of 245 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:37:53] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:37:53] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:37:53] [INFO ] Deduced a trap composed of 216 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:37:53] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:37:54] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:37:54] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:37:54] [INFO ] Deduced a trap composed of 261 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:37:55] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 213 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 81/81 constraints]
After SMT, in 62510ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62524ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/903 places, 1103/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91810 ms. Remains : 770/903 places, 1103/1236 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 48 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-06 finished in 91916 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 8 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1172
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 839 transition count 1172
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 128 place count 839 transition count 1107
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 258 place count 774 transition count 1107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 262 place count 772 transition count 1105
Applied a total of 262 rules in 89 ms. Remains 772 /903 variables (removed 131) and now considering 1105/1236 (removed 131) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 06:38:07] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 06:38:07] [INFO ] Computed 137 invariants in 21 ms
[2024-05-28 06:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 7 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:38:23] [INFO ] Deduced a trap composed of 238 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:38:23] [INFO ] Deduced a trap composed of 238 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:38:23] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 250 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 198 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 238 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 232 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 238 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 250 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 253 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:26] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 150 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:38:31] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:38:32] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 229 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:38:33] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 247 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 241 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:38:34] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:38:35] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:35] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:38:35] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:38:35] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:38:36] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:38:36] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:37] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 3 ms to minimize.
[2024-05-28 06:38:37] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:38:37] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:38:38] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:38:38] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:38:38] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:38:38] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:38:39] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 215 ms of which 3 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 202 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 202 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:38:42] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:38:42] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:38:43] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:38:43] [INFO ] Deduced a trap composed of 202 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 202 places in 298 ms of which 6 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 199 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 259 places in 243 ms of which 3 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 229 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 241 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 202 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 199 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 4 ms to minimize.
[2024-05-28 06:38:49] [INFO ] Deduced a trap composed of 235 places in 344 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 210 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 78/78 constraints]
After SMT, in 42568ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 42579ms
[2024-05-28 06:38:50] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:38:50] [INFO ] Invariant cache hit.
[2024-05-28 06:38:50] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-28 06:38:50] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:38:50] [INFO ] Invariant cache hit.
[2024-05-28 06:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:38:54] [INFO ] Implicit Places using invariants and state equation in 3233 ms returned []
Implicit Place search using SMT with State Equation took 3946 ms to find 0 implicit places.
[2024-05-28 06:38:54] [INFO ] Redundant transitions in 33 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 06:38:54] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:38:54] [INFO ] Invariant cache hit.
[2024-05-28 06:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:39:09] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:39:10] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:39:10] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:39:10] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:39:11] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:39:11] [INFO ] Deduced a trap composed of 198 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:39:23] [INFO ] Deduced a trap composed of 198 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:39:23] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 5 ms to minimize.
[2024-05-28 06:39:23] [INFO ] Deduced a trap composed of 198 places in 283 ms of which 5 ms to minimize.
[2024-05-28 06:39:24] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 06:39:24] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 5 ms to minimize.
[2024-05-28 06:39:24] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:39:24] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:39:25] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:39:25] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:39:25] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:39:25] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 3 ms to minimize.
[2024-05-28 06:39:26] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:39:26] [INFO ] Deduced a trap composed of 198 places in 222 ms of which 4 ms to minimize.
SMT process timed out in 32338ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 32355ms
Starting structural reductions in SI_LTL mode, iteration 1 : 772/903 places, 1105/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79014 ms. Remains : 772/903 places, 1105/1236 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-07
Product exploration explored 100000 steps with 9190 reset in 680 ms.
Product exploration explored 100000 steps with 9131 reset in 675 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2073 resets) in 448 ms. (89 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
[2024-05-28 06:39:28] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:39:28] [INFO ] Invariant cache hit.
[2024-05-28 06:39:28] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/269 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/391 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 366/757 variables, 61/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/758 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/758 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/770 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/770 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/772 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/772 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1101/1873 variables, 772/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1873 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1873 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1873 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1873/1873 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 261/269 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:39:29] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 122/391 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 366/757 variables, 61/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/758 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/758 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 770/1873 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 925ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1105/1105 transitions.
Applied a total of 0 rules in 50 ms. Remains 772 /772 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 06:39:29] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:39:29] [INFO ] Invariant cache hit.
[2024-05-28 06:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 198 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:39:46] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 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 Real declared 767/1873 variables, and 138 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:39:53] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:39:53] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:39:54] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:39:54] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:39:54] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 6 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:39:56] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:39:56] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:39:56] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:39:56] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:39:57] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:39:57] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:39:57] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:39:57] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:39:58] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 5 ms to minimize.
[2024-05-28 06:39:58] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:39:58] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:39:59] [INFO ] Deduced a trap composed of 247 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:39:59] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 5 ms to minimize.
[2024-05-28 06:40:00] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 7 ms to minimize.
[2024-05-28 06:40:00] [INFO ] Deduced a trap composed of 198 places in 299 ms of which 4 ms to minimize.
[2024-05-28 06:40:00] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 5 ms to minimize.
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 198 places in 288 ms of which 5 ms to minimize.
[2024-05-28 06:40:01] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 5 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 3 ms to minimize.
[2024-05-28 06:40:02] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 4 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 198 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 198 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:40:03] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 198 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 198 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:40:04] [INFO ] Deduced a trap composed of 198 places in 210 ms of which 3 ms to minimize.
[2024-05-28 06:40:05] [INFO ] Deduced a trap composed of 198 places in 216 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:40:05] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 5 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 5 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 3 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 3 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:40:11] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 198 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 66/66 constraints]
After SMT, in 42438ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 42447ms
[2024-05-28 06:40:11] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:40:12] [INFO ] Invariant cache hit.
[2024-05-28 06:40:12] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-28 06:40:12] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:40:12] [INFO ] Invariant cache hit.
[2024-05-28 06:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:40:15] [INFO ] Implicit Places using invariants and state equation in 2938 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
[2024-05-28 06:40:15] [INFO ] Redundant transitions in 24 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 06:40:15] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 06:40:15] [INFO ] Invariant cache hit.
[2024-05-28 06:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:40:31] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 3 ms to minimize.
[2024-05-28 06:40:32] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:40:42] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:40:43] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:40:43] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:40:43] [INFO ] Deduced a trap composed of 198 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:40:43] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:40:44] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:40:44] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:40:44] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:40:45] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:40:45] [INFO ] Deduced a trap composed of 198 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:40:45] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:45] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 5 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 3 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 3 ms to minimize.
[2024-05-28 06:40:46] [INFO ] Deduced a trap composed of 244 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 50 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:47] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 158 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 26/158 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 202 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:40:50] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 3 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 202 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 199 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 202 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 202 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 202 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 199 places in 229 ms of which 3 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:40:55] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:40:57] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 3 ms to minimize.
[2024-05-28 06:40:57] [INFO ] Deduced a trap composed of 202 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:40:57] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 5 ms to minimize.
[2024-05-28 06:40:57] [INFO ] Deduced a trap composed of 202 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:40:58] [INFO ] Deduced a trap composed of 202 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:40:58] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:40:58] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 202 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:41:00] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:41:00] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:41:00] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:41:00] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 5 ms to minimize.
[2024-05-28 06:41:02] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 5 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 5 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 5 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:41:03] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:41:04] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:41:05] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:05] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:41:05] [INFO ] Deduced a trap composed of 198 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:41:05] [INFO ] Deduced a trap composed of 235 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:41:06] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:41:06] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:41:06] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:41:06] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:41:07] [INFO ] Deduced a trap composed of 198 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:07] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:41:07] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 202 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:41:09] [INFO ] Deduced a trap composed of 198 places in 279 ms of which 5 ms to minimize.
[2024-05-28 06:41:10] [INFO ] Deduced a trap composed of 202 places in 227 ms of which 3 ms to minimize.
[2024-05-28 06:41:10] [INFO ] Deduced a trap composed of 202 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:10] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 3 ms to minimize.
[2024-05-28 06:41:10] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:41:11] [INFO ] Deduced a trap composed of 202 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:41:11] [INFO ] Deduced a trap composed of 198 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:41:11] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 5 ms to minimize.
[2024-05-28 06:41:11] [INFO ] Deduced a trap composed of 248 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:41:12] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:41:12] [INFO ] Deduced a trap composed of 202 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:41:12] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:41:12] [INFO ] Deduced a trap composed of 202 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:41:13] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:41:13] [INFO ] Deduced a trap composed of 202 places in 289 ms of which 4 ms to minimize.
[2024-05-28 06:41:13] [INFO ] Deduced a trap composed of 198 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:41:14] [INFO ] Deduced a trap composed of 202 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:41:14] [INFO ] Deduced a trap composed of 202 places in 224 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 06:41:16] [INFO ] Deduced a trap composed of 251 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:41:16] [INFO ] Deduced a trap composed of 198 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:41:17] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:41:17] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:41:17] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:41:18] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 63019ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 63036ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109214 ms. Remains : 772/772 places, 1105/1105 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 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 53 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 steps (1 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 73 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9219 reset in 611 ms.
Product exploration explored 100000 steps with 9154 reset in 629 ms.
Support contains 6 out of 772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1105/1105 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 771 transition count 1104
Applied a total of 2 rules in 48 ms. Remains 771 /772 variables (removed 1) and now considering 1104/1105 (removed 1) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 06:41:20] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
// Phase 1: matrix 1100 rows 771 cols
[2024-05-28 06:41:20] [INFO ] Computed 137 invariants in 19 ms
[2024-05-28 06:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 197 places in 287 ms of which 5 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 3 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 Real declared 766/1871 variables, and 134 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:41:44] [INFO ] Deduced a trap composed of 258 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:41:44] [INFO ] Deduced a trap composed of 261 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:41:44] [INFO ] Deduced a trap composed of 246 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:41:45] [INFO ] Deduced a trap composed of 231 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:41:45] [INFO ] Deduced a trap composed of 222 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:41:45] [INFO ] Deduced a trap composed of 249 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:41:46] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:41:46] [INFO ] Deduced a trap composed of 249 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:41:46] [INFO ] Deduced a trap composed of 240 places in 291 ms of which 5 ms to minimize.
[2024-05-28 06:41:47] [INFO ] Deduced a trap composed of 234 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:41:47] [INFO ] Deduced a trap composed of 237 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:41:47] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 5 ms to minimize.
[2024-05-28 06:41:47] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:41:48] [INFO ] Deduced a trap composed of 258 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:41:48] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:41:48] [INFO ] Deduced a trap composed of 264 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:41:48] [INFO ] Deduced a trap composed of 237 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:41:49] [INFO ] Deduced a trap composed of 246 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:41:49] [INFO ] Deduced a trap composed of 252 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:41:49] [INFO ] Deduced a trap composed of 258 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:41:50] [INFO ] Deduced a trap composed of 201 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:41:50] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:41:50] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:41:51] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:51] [INFO ] Deduced a trap composed of 201 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:41:51] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:41:51] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 221 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 201 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:41:55] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:41:56] [INFO ] Deduced a trap composed of 342 places in 293 ms of which 5 ms to minimize.
[2024-05-28 06:41:58] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 06:42:00] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:42:00] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:42:00] [INFO ] Deduced a trap composed of 247 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 5 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 201 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 201 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 201 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:42:03] [INFO ] Deduced a trap composed of 229 places in 229 ms of which 4 ms to minimize.
SMT process timed out in 42639ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 42649ms
[2024-05-28 06:42:03] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 06:42:03] [INFO ] Invariant cache hit.
[2024-05-28 06:42:03] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-28 06:42:03] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 06:42:03] [INFO ] Invariant cache hit.
[2024-05-28 06:42:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:42:08] [INFO ] Implicit Places using invariants and state equation in 4649 ms returned []
Implicit Place search using SMT with State Equation took 5346 ms to find 0 implicit places.
[2024-05-28 06:42:08] [INFO ] Redundant transitions in 19 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-28 06:42:08] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 06:42:08] [INFO ] Invariant cache hit.
[2024-05-28 06:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:42:22] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:42:22] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 234 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 197 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:42:23] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:42:24] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:42:24] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:42:24] [INFO ] Deduced a trap composed of 225 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:42:24] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:42:25] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:42:25] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:42:25] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:42:25] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:42:26] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:42:26] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 3 ms to minimize.
[2024-05-28 06:42:26] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 197 places in 289 ms of which 4 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:42:27] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 197 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:42:28] [INFO ] Deduced a trap composed of 197 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 197 places in 289 ms of which 5 ms to minimize.
[2024-05-28 06:42:29] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 5 ms to minimize.
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 197 places in 292 ms of which 4 ms to minimize.
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 197 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:42:30] [INFO ] Deduced a trap composed of 237 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 5 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 243 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:42:31] [INFO ] Deduced a trap composed of 243 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 231 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 197 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:42:32] [INFO ] Deduced a trap composed of 243 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 261 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:42:33] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 172 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:42:42] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:42:42] [INFO ] Deduced a trap composed of 237 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:42:43] [INFO ] Deduced a trap composed of 197 places in 267 ms of which 5 ms to minimize.
[2024-05-28 06:42:43] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:42:43] [INFO ] Deduced a trap composed of 197 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:42:43] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:42:43] [INFO ] Deduced a trap composed of 197 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:42:44] [INFO ] Deduced a trap composed of 197 places in 216 ms of which 3 ms to minimize.
[2024-05-28 06:42:44] [INFO ] Deduced a trap composed of 197 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:42:44] [INFO ] Deduced a trap composed of 197 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:42:44] [INFO ] Deduced a trap composed of 197 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:42:45] [INFO ] Deduced a trap composed of 197 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:42:45] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:42:45] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:42:45] [INFO ] Deduced a trap composed of 197 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:42:46] [INFO ] Deduced a trap composed of 197 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:42:46] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:42:46] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:42:46] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:42:47] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:42:48] [INFO ] Deduced a trap composed of 338 places in 313 ms of which 4 ms to minimize.
[2024-05-28 06:42:49] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 6 ms to minimize.
[2024-05-28 06:42:49] [INFO ] Deduced a trap composed of 332 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:42:49] [INFO ] Deduced a trap composed of 338 places in 283 ms of which 5 ms to minimize.
[2024-05-28 06:42:50] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 2 ms to minimize.
[2024-05-28 06:42:52] [INFO ] Deduced a trap composed of 201 places in 348 ms of which 5 ms to minimize.
[2024-05-28 06:42:53] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:42:53] [INFO ] Deduced a trap composed of 201 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:42:53] [INFO ] Deduced a trap composed of 197 places in 267 ms of which 5 ms to minimize.
[2024-05-28 06:42:54] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:42:54] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:42:54] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:42:54] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:42:55] [INFO ] Deduced a trap composed of 201 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:42:55] [INFO ] Deduced a trap composed of 197 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:42:55] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:42:56] [INFO ] Deduced a trap composed of 201 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:42:56] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:42:56] [INFO ] Deduced a trap composed of 201 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:42:56] [INFO ] Deduced a trap composed of 197 places in 263 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:42:58] [INFO ] Deduced a trap composed of 201 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:42:58] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:42:58] [INFO ] Deduced a trap composed of 201 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:42:58] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 3 ms to minimize.
[2024-05-28 06:42:59] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:42:59] [INFO ] Deduced a trap composed of 197 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:42:59] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:43:00] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:43:00] [INFO ] Deduced a trap composed of 201 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:43:00] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:43:00] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:43:01] [INFO ] Deduced a trap composed of 197 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:43:01] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 5 ms to minimize.
[2024-05-28 06:43:01] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:43:01] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:43:02] [INFO ] Deduced a trap composed of 201 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:43:02] [INFO ] Deduced a trap composed of 197 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:43:02] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 5 ms to minimize.
[2024-05-28 06:43:02] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:43:03] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 5 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 197 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 197 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:43:05] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:43:06] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:43:07] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:43:07] [INFO ] Deduced a trap composed of 197 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:43:07] [INFO ] Deduced a trap composed of 197 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:43:07] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:43:08] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:43:09] [INFO ] Deduced a trap composed of 201 places in 276 ms of which 5 ms to minimize.
[2024-05-28 06:43:09] [INFO ] Deduced a trap composed of 197 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:43:09] [INFO ] Deduced a trap composed of 201 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:43:10] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:43:10] [INFO ] Deduced a trap composed of 197 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:43:10] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 252 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 120/120 constraints]
After SMT, in 62518ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 62533ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/772 places, 1104/1105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110605 ms. Remains : 771/772 places, 1104/1105 transitions.
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-07 finished in 303696 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 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Applied a total of 0 rules in 18 ms. Remains 903 /903 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:43:11] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 06:43:11] [INFO ] Computed 137 invariants in 19 ms
[2024-05-28 06:43:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 0.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 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.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 4.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 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.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 (/ 1.0 3.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.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 (/ 1.0 3.0))
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 (/ 2.0 3.0))
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 (/ 2.0 3.0))
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 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 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42544ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42557ms
[2024-05-28 06:43:53] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:43:53] [INFO ] Invariant cache hit.
[2024-05-28 06:43:54] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-28 06:43:54] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:43:54] [INFO ] Invariant cache hit.
[2024-05-28 06:43:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:44:00] [INFO ] Implicit Places using invariants and state equation in 5919 ms returned []
Implicit Place search using SMT with State Equation took 6835 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 06:44:00] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 06:44:00] [INFO ] Invariant cache hit.
[2024-05-28 06:44:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 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 0.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 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 1.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 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 (/ 2.0 3.0))
(s144 1.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.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 (/ 2.0 3.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 (/ 2.0 3.0))
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 06:44:58] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 4 ms to minimize.
[2024-05-28 06:44:58] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 5 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 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62771ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62784ms
Finished structural reductions in LTL mode , in 1 iterations and 112201 ms. Remains : 903/903 places, 1236/1236 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-11 finished in 112324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 838 transition count 1107
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 774 transition count 1107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 771 transition count 1104
Applied a total of 264 rules in 58 ms. Remains 771 /903 variables (removed 132) and now considering 1104/1236 (removed 132) transitions.
Running 1098 sub problems to find dead transitions.
[2024-05-28 06:45:03] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
// Phase 1: matrix 1100 rows 771 cols
[2024-05-28 06:45:03] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 06:45:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:45:16] [INFO ] Deduced a trap composed of 240 places in 298 ms of which 5 ms to minimize.
[2024-05-28 06:45:16] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:45:17] [INFO ] Deduced a trap composed of 246 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:45:17] [INFO ] Deduced a trap composed of 197 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:45:17] [INFO ] Deduced a trap composed of 197 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:45:17] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:45:18] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:45:18] [INFO ] Deduced a trap composed of 197 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:45:18] [INFO ] Deduced a trap composed of 197 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:45:19] [INFO ] Deduced a trap composed of 197 places in 293 ms of which 4 ms to minimize.
[2024-05-28 06:45:19] [INFO ] Deduced a trap composed of 197 places in 293 ms of which 5 ms to minimize.
[2024-05-28 06:45:19] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:45:19] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:45:20] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 4 ms to minimize.
[2024-05-28 06:45:20] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:45:20] [INFO ] Deduced a trap composed of 197 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:45:20] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:45:21] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:45:21] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:45:21] [INFO ] Deduced a trap composed of 223 places in 256 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 152 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:45:28] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 2 ms to minimize.
[2024-05-28 06:45:38] [INFO ] Deduced a trap composed of 234 places in 283 ms of which 5 ms to minimize.
[2024-05-28 06:45:38] [INFO ] Deduced a trap composed of 297 places in 213 ms of which 4 ms to minimize.
[2024-05-28 06:45:39] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 5 ms to minimize.
[2024-05-28 06:45:43] [INFO ] Deduced a trap composed of 299 places in 210 ms of which 4 ms to minimize.
[2024-05-28 06:45:43] [INFO ] Deduced a trap composed of 299 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:45:43] [INFO ] Deduced a trap composed of 301 places in 204 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 159 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 27/27 constraints]
After SMT, in 42585ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 42596ms
[2024-05-28 06:45:46] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 06:45:46] [INFO ] Invariant cache hit.
[2024-05-28 06:45:46] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-28 06:45:46] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 06:45:46] [INFO ] Invariant cache hit.
[2024-05-28 06:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:45:51] [INFO ] Implicit Places using invariants and state equation in 4508 ms returned []
Implicit Place search using SMT with State Equation took 5193 ms to find 0 implicit places.
[2024-05-28 06:45:51] [INFO ] Redundant transitions in 25 ms returned []
Running 1098 sub problems to find dead transitions.
[2024-05-28 06:45:51] [INFO ] Flow matrix only has 1100 transitions (discarded 4 similar events)
[2024-05-28 06:45:51] [INFO ] Invariant cache hit.
[2024-05-28 06:45:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:46:06] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 3 ms to minimize.
[2024-05-28 06:46:06] [INFO ] Deduced a trap composed of 258 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:46:07] [INFO ] Deduced a trap composed of 197 places in 296 ms of which 6 ms to minimize.
[2024-05-28 06:46:07] [INFO ] Deduced a trap composed of 246 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:46:07] [INFO ] Deduced a trap composed of 231 places in 224 ms of which 3 ms to minimize.
[2024-05-28 06:46:08] [INFO ] Deduced a trap composed of 197 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:46:08] [INFO ] Deduced a trap composed of 197 places in 224 ms of which 3 ms to minimize.
[2024-05-28 06:46:08] [INFO ] Deduced a trap composed of 249 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:46:08] [INFO ] Deduced a trap composed of 252 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:46:09] [INFO ] Deduced a trap composed of 231 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:46:09] [INFO ] Deduced a trap composed of 225 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:46:09] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:46:09] [INFO ] Deduced a trap composed of 246 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:46:10] [INFO ] Deduced a trap composed of 240 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:46:10] [INFO ] Deduced a trap composed of 225 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:46:10] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:46:10] [INFO ] Deduced a trap composed of 197 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:46:10] [INFO ] Deduced a trap composed of 243 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:46:11] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:46:11] [INFO ] Deduced a trap composed of 197 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:46:12] [INFO ] Deduced a trap composed of 246 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:46:12] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:46:12] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:46:13] [INFO ] Deduced a trap composed of 246 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:46:13] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:46:13] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:46:13] [INFO ] Deduced a trap composed of 249 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:46:14] [INFO ] Deduced a trap composed of 237 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:46:14] [INFO ] Deduced a trap composed of 252 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:46:14] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:46:14] [INFO ] Deduced a trap composed of 258 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:46:15] [INFO ] Deduced a trap composed of 246 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:46:15] [INFO ] Deduced a trap composed of 243 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:46:15] [INFO ] Deduced a trap composed of 234 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:46:15] [INFO ] Deduced a trap composed of 252 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:46:16] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:46:16] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:46:16] [INFO ] Deduced a trap composed of 258 places in 229 ms of which 3 ms to minimize.
[2024-05-28 06:46:16] [INFO ] Deduced a trap composed of 225 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:46:17] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1871 variables, and 172 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:46:28] [INFO ] Deduced a trap composed of 197 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:46:32] [INFO ] Deduced a trap composed of 197 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:46:32] [INFO ] Deduced a trap composed of 197 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:46:33] [INFO ] Deduced a trap composed of 200 places in 258 ms of which 3 ms to minimize.
[2024-05-28 06:46:33] [INFO ] Deduced a trap composed of 197 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:46:33] [INFO ] Deduced a trap composed of 200 places in 238 ms of which 4 ms to minimize.
[2024-05-28 06:46:33] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:46:34] [INFO ] Deduced a trap composed of 200 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:46:34] [INFO ] Deduced a trap composed of 197 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:46:34] [INFO ] Deduced a trap composed of 200 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:46:35] [INFO ] Deduced a trap composed of 197 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:46:35] [INFO ] Deduced a trap composed of 200 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:46:35] [INFO ] Deduced a trap composed of 197 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:46:35] [INFO ] Deduced a trap composed of 197 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:46:36] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:46:36] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:46:37] [INFO ] Deduced a trap composed of 197 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:46:37] [INFO ] Deduced a trap composed of 197 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:46:38] [INFO ] Deduced a trap composed of 200 places in 301 ms of which 5 ms to minimize.
[2024-05-28 06:46:39] [INFO ] Deduced a trap composed of 197 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-28 06:46:43] [INFO ] Deduced a trap composed of 243 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:46:44] [INFO ] Deduced a trap composed of 243 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:46:44] [INFO ] Deduced a trap composed of 237 places in 290 ms of which 5 ms to minimize.
[2024-05-28 06:46:44] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:46:45] [INFO ] Deduced a trap composed of 237 places in 247 ms of which 5 ms to minimize.
[2024-05-28 06:46:45] [INFO ] Deduced a trap composed of 252 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:46:45] [INFO ] Deduced a trap composed of 197 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:46:45] [INFO ] Deduced a trap composed of 200 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:46:46] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:46:46] [INFO ] Deduced a trap composed of 197 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:46:46] [INFO ] Deduced a trap composed of 197 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:46:46] [INFO ] Deduced a trap composed of 197 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:46:47] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 4 ms to minimize.
[2024-05-28 06:46:47] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:46:47] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:46:47] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:46:48] [INFO ] Deduced a trap composed of 255 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:46:48] [INFO ] Deduced a trap composed of 261 places in 324 ms of which 4 ms to minimize.
[2024-05-28 06:46:48] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:46:49] [INFO ] Deduced a trap composed of 197 places in 330 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1871 variables, and 212 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 80/80 constraints]
After SMT, in 62991ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 63008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/903 places, 1104/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110892 ms. Remains : 771/903 places, 1104/1236 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-12
Stuttering criterion allowed to conclude after 415 steps with 57 reset in 6 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-12 finished in 110996 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((F(G(p0))&&G(p1))))'
Support contains 307 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 773 transition count 1106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 770 transition count 1103
Applied a total of 266 rules in 68 ms. Remains 770 /903 variables (removed 133) and now considering 1103/1236 (removed 133) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:46:54] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 06:46:54] [INFO ] Computed 137 invariants in 22 ms
[2024-05-28 06:46:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:47:09] [INFO ] Deduced a trap composed of 239 places in 271 ms of which 5 ms to minimize.
[2024-05-28 06:47:09] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 4 ms to minimize.
[2024-05-28 06:47:09] [INFO ] Deduced a trap composed of 227 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:47:10] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:47:10] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 6 ms to minimize.
[2024-05-28 06:47:10] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 5 ms to minimize.
[2024-05-28 06:47:10] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:47:11] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:47:11] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 7 ms to minimize.
[2024-05-28 06:47:11] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:47:11] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:47:12] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-05-28 06:47:12] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:47:12] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:47:12] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:47:13] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-05-28 06:47:13] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 3 ms to minimize.
[2024-05-28 06:47:13] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:47:13] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:47:14] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:47:14] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-05-28 06:47:15] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 3 ms to minimize.
[2024-05-28 06:47:15] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:47:15] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:47:15] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:47:16] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-05-28 06:47:16] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 06:47:16] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:47:16] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-05-28 06:47:17] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:47:17] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:47:17] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
SMT process timed out in 23105ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23117ms
[2024-05-28 06:47:17] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:47:17] [INFO ] Invariant cache hit.
[2024-05-28 06:47:18] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-28 06:47:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:47:18] [INFO ] Invariant cache hit.
[2024-05-28 06:47:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:47:24] [INFO ] Implicit Places using invariants and state equation in 5790 ms returned []
Implicit Place search using SMT with State Equation took 6423 ms to find 0 implicit places.
[2024-05-28 06:47:24] [INFO ] Redundant transitions in 19 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:47:24] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:47:24] [INFO ] Invariant cache hit.
[2024-05-28 06:47:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:47:38] [INFO ] Deduced a trap composed of 245 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:47:38] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:47:38] [INFO ] Deduced a trap composed of 233 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:47:38] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:47:39] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 5 ms to minimize.
[2024-05-28 06:47:39] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:47:39] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:47:40] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 3 ms to minimize.
[2024-05-28 06:47:40] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-28 06:47:40] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 4 ms to minimize.
[2024-05-28 06:47:40] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 3 ms to minimize.
[2024-05-28 06:47:41] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-05-28 06:47:41] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:47:41] [INFO ] Deduced a trap composed of 254 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:47:41] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:47:42] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:47:42] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:47:42] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:47:42] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-05-28 06:47:43] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:47:43] [INFO ] Deduced a trap composed of 254 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:47:43] [INFO ] Deduced a trap composed of 245 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:47:44] [INFO ] Deduced a trap composed of 248 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:47:44] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-05-28 06:47:44] [INFO ] Deduced a trap composed of 251 places in 224 ms of which 4 ms to minimize.
[2024-05-28 06:47:45] [INFO ] Deduced a trap composed of 196 places in 216 ms of which 4 ms to minimize.
[2024-05-28 06:47:45] [INFO ] Deduced a trap composed of 233 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:47:45] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 4 ms to minimize.
[2024-05-28 06:47:45] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:47:46] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:47:46] [INFO ] Deduced a trap composed of 260 places in 246 ms of which 5 ms to minimize.
[2024-05-28 06:47:46] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:47:46] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 3 ms to minimize.
[2024-05-28 06:47:47] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-05-28 06:47:47] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:47:47] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 4 ms to minimize.
[2024-05-28 06:47:47] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-05-28 06:47:48] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:47:48] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 5 ms to minimize.
[2024-05-28 06:47:48] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.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 0.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 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:48:01] [INFO ] Deduced a trap composed of 200 places in 345 ms of which 5 ms to minimize.
[2024-05-28 06:48:02] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 5 ms to minimize.
[2024-05-28 06:48:02] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:48:02] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 06:48:03] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:48:03] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:48:03] [INFO ] Deduced a trap composed of 200 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:48:03] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:48:04] [INFO ] Deduced a trap composed of 200 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:48:04] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:48:04] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:48:05] [INFO ] Deduced a trap composed of 200 places in 306 ms of which 4 ms to minimize.
[2024-05-28 06:48:05] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:48:05] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:48:05] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:48:06] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:48:06] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:48:06] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:48:06] [INFO ] Deduced a trap composed of 200 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:48:07] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:48:09] [INFO ] Deduced a trap composed of 249 places in 315 ms of which 5 ms to minimize.
[2024-05-28 06:48:10] [INFO ] Deduced a trap composed of 248 places in 211 ms of which 4 ms to minimize.
[2024-05-28 06:48:10] [INFO ] Deduced a trap composed of 237 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:48:10] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 5 ms to minimize.
[2024-05-28 06:48:10] [INFO ] Deduced a trap composed of 248 places in 248 ms of which 5 ms to minimize.
[2024-05-28 06:48:11] [INFO ] Deduced a trap composed of 255 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:48:11] [INFO ] Deduced a trap composed of 237 places in 239 ms of which 4 ms to minimize.
[2024-05-28 06:48:11] [INFO ] Deduced a trap composed of 248 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:48:12] [INFO ] Deduced a trap composed of 242 places in 215 ms of which 3 ms to minimize.
[2024-05-28 06:48:12] [INFO ] Deduced a trap composed of 236 places in 204 ms of which 4 ms to minimize.
[2024-05-28 06:48:12] [INFO ] Deduced a trap composed of 254 places in 209 ms of which 3 ms to minimize.
[2024-05-28 06:48:12] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:48:13] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-05-28 06:48:13] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-05-28 06:48:14] [INFO ] Deduced a trap composed of 216 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:48:14] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 5 ms to minimize.
[2024-05-28 06:48:14] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:48:15] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 06:48:15] [INFO ] Deduced a trap composed of 261 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:48:15] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:48:26] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 213 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 81/81 constraints]
After SMT, in 62774ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/903 places, 1103/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92429 ms. Remains : 770/903 places, 1103/1236 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLCardinality-15
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLCardinality-15 finished in 92548 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)))))'
[2024-05-28 06:48:27] [INFO ] Flatten gal took : 82 ms
[2024-05-28 06:48:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 06:48:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 903 places, 1236 transitions and 5897 arcs took 16 ms.
Total runtime 1045752 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J60

IS_COLORED=
IS_NUPN=

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

SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 3410
MODEL NAME: /home/mcc/execution/415/model
903 places, 1236 transitions.

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

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

Sequence of Actions to be Executed by the VM

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

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

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