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-171654445400179.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 PolyORBLF-COL-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716855381762

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:16:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 00:16:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:16:23] [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 00:16:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:16:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1046 ms
[2024-05-28 00:16:24] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 00:16:24] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2024-05-28 00:16:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40010 steps (3883 resets) in 1262 ms. (31 steps per ms) remains 20/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 158 ms. (25 steps per ms) remains 9/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 70 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (17 resets) in 20 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4001 steps (18 resets) in 40 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (12 resets) in 53 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (14 resets) in 25 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4002 steps (21 resets) in 18 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4002 steps (19 resets) in 35 ms. (111 steps per ms) remains 8/8 properties
[2024-05-28 00:16:25] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:16:25] [INFO ] Computed 26 invariants in 13 ms
[2024-05-28 00:16:25] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/51 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/77 variables, 14/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 7 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/28 variables, 1/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/35 variables, 4/6 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/45 variables, 2/8 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/49 variables, 1/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-05-28 00:16:26] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 66 ms to minimize.
[2024-05-28 00:16:26] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 23 constraints, problems are : Problem set: 8 solved, 0 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1159ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:16:27] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 00:16:27] [INFO ] Flatten gal took : 53 ms
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 00:16:27] [INFO ] Flatten gal took : 16 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-05-28 00:16:27] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 336 ms.
[2024-05-28 00:16:27] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 158 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Applied a total of 18 rules in 287 ms. Remains 620 /632 variables (removed 12) and now considering 2424/2430 (removed 6) transitions.
Running 2418 sub problems to find dead transitions.
[2024-05-28 00:16:28] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 620 cols
[2024-05-28 00:16:28] [INFO ] Computed 48 invariants in 230 ms
[2024-05-28 00:16:28] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
SMT process timed out in 41689ms, After SMT, problems are : Problem set: 0 solved, 2418 unsolved
Search for dead transitions found 0 dead transitions in 41791ms
[2024-05-28 00:17:09] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-05-28 00:17:09] [INFO ] Invariant cache hit.
[2024-05-28 00:17:10] [INFO ] Implicit Places using invariants in 573 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 598 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 614/632 places, 2424/2430 transitions.
Applied a total of 0 rules in 24 ms. Remains 614 /614 variables (removed 0) and now considering 2424/2424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42735 ms. Remains : 614/632 places, 2424/2430 transitions.
Support contains 158 out of 614 places after structural reductions.
[2024-05-28 00:17:10] [INFO ] Flatten gal took : 331 ms
[2024-05-28 00:17:11] [INFO ] Flatten gal took : 206 ms
[2024-05-28 00:17:11] [INFO ] Input system was already deterministic with 2424 transitions.
RANDOM walk for 40000 steps (229 resets) in 1032 ms. (38 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40002 steps (115 resets) in 301 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 309 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (148 resets) in 355 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (105 resets) in 348 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (38 resets) in 246 ms. (161 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (96 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (123 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
[2024-05-28 00:17:13] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 614 cols
[2024-05-28 00:17:13] [INFO ] Computed 42 invariants in 47 ms
[2024-05-28 00:17:13] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/213 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/218 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 6 (OVERLAPS) 387/605 variables, 21/35 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-28 00:17:14] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 1 ms to minimize.
[2024-05-28 00:17:14] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 2/37 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/606 variables, 1/38 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 11 (OVERLAPS) 6/612 variables, 5/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3000/3002 variables, and 655 constraints, problems are : Problem set: 5 solved, 1 unsolved in 3008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 612/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 486/499 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/549 variables, 12/21 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/611 variables, 19/40 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 2/42 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-28 00:17:17] [INFO ] Deduced a trap composed of 85 places in 774 ms of which 6 ms to minimize.
[2024-05-28 00:17:18] [INFO ] Deduced a trap composed of 85 places in 898 ms of which 5 ms to minimize.
[2024-05-28 00:17:19] [INFO ] Deduced a trap composed of 153 places in 982 ms of which 7 ms to minimize.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 611/3002 variables, and 45 constraints, problems are : Problem set: 6 solved, 0 unsolved in 3143 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 6237ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 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(F(!p0)))'
Support contains 6 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 87 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 00:17:19] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 00:17:19] [INFO ] Computed 42 invariants in 73 ms
[2024-05-28 00:17:19] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 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 602/2990 variables, and 36 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:18:03] [INFO ] Deduced a trap composed of 84 places in 421 ms of which 3 ms to minimize.
[2024-05-28 00:18:03] [INFO ] Deduced a trap composed of 84 places in 357 ms of which 2 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 84 places in 701 ms of which 1 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 1 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 0 ms to minimize.
[2024-05-28 00:18:06] [INFO ] Deduced a trap composed of 139 places in 432 ms of which 4 ms to minimize.
[2024-05-28 00:18:06] [INFO ] Deduced a trap composed of 167 places in 408 ms of which 3 ms to minimize.
[2024-05-28 00:18:07] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-05-28 00:18:08] [INFO ] Deduced a trap composed of 337 places in 459 ms of which 3 ms to minimize.
[2024-05-28 00:18:10] [INFO ] Deduced a trap composed of 380 places in 588 ms of which 5 ms to minimize.
[2024-05-28 00:18:11] [INFO ] Deduced a trap composed of 45 places in 538 ms of which 4 ms to minimize.
[2024-05-28 00:18:11] [INFO ] Deduced a trap composed of 361 places in 497 ms of which 4 ms to minimize.
[2024-05-28 00:18:12] [INFO ] Deduced a trap composed of 363 places in 518 ms of which 4 ms to minimize.
[2024-05-28 00:18:12] [INFO ] Deduced a trap composed of 92 places in 506 ms of which 3 ms to minimize.
[2024-05-28 00:18:13] [INFO ] Deduced a trap composed of 380 places in 510 ms of which 4 ms to minimize.
[2024-05-28 00:18:14] [INFO ] Deduced a trap composed of 344 places in 494 ms of which 4 ms to minimize.
[2024-05-28 00:18:14] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 2 ms to minimize.
[2024-05-28 00:18:14] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 2 ms to minimize.
[2024-05-28 00:18:14] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2024-05-28 00:18:17] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:18:21] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 2 ms to minimize.
SMT process timed out in 61887ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61938ms
[2024-05-28 00:18:21] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:18:21] [INFO ] Invariant cache hit.
[2024-05-28 00:18:22] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-28 00:18:22] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:18:22] [INFO ] Invariant cache hit.
[2024-05-28 00:18:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:18:34] [INFO ] Implicit Places using invariants and state equation in 12183 ms returned []
Implicit Place search using SMT with State Equation took 12819 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 00:18:34] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:18:34] [INFO ] Invariant cache hit.
[2024-05-28 00:18:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:19:14] [INFO ] Deduced a trap composed of 84 places in 171 ms of which 2 ms to minimize.
[2024-05-28 00:19:15] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-05-28 00:19:15] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 1 ms to minimize.
[2024-05-28 00:19:15] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:19:15] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:19:16] [INFO ] Deduced a trap composed of 350 places in 396 ms of which 3 ms to minimize.
[2024-05-28 00:19:16] [INFO ] Deduced a trap composed of 172 places in 376 ms of which 7 ms to minimize.
[2024-05-28 00:19:16] [INFO ] Deduced a trap composed of 177 places in 392 ms of which 4 ms to minimize.
[2024-05-28 00:19:17] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-28 00:19:20] [INFO ] Deduced a trap composed of 373 places in 557 ms of which 4 ms to minimize.
[2024-05-28 00:19:21] [INFO ] Deduced a trap composed of 368 places in 561 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:19:29] [INFO ] Deduced a trap composed of 305 places in 472 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 48 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 12/12 constraints]
After SMT, in 81305ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 81363ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156227 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1237 ms.
Product exploration explored 100000 steps with 50000 reset in 1068 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-01 finished in 158849 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 7 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 614 transition count 2388
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 572 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 84 place count 572 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 228 place count 500 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 372 place count 428 transition count 2238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 378 place count 422 transition count 2232
Iterating global reduction 3 with 6 rules applied. Total rules applied 384 place count 422 transition count 2232
Applied a total of 384 rules in 431 ms. Remains 422 /614 variables (removed 192) and now considering 2232/2424 (removed 192) transitions.
Running 2226 sub problems to find dead transitions.
[2024-05-28 00:19:58] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2024-05-28 00:19:58] [INFO ] Computed 42 invariants in 66 ms
[2024-05-28 00:19:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:20:40] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2024-05-28 00:20:40] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 2 ms to minimize.
[2024-05-28 00:20:40] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-05-28 00:20:40] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 00:20:40] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-05-28 00:20:41] [INFO ] Deduced a trap composed of 193 places in 415 ms of which 2 ms to minimize.
[2024-05-28 00:20:42] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 43 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:20:50] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 2 ms to minimize.
[2024-05-28 00:20:50] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 9/9 constraints]
After SMT, in 69039ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 69099ms
[2024-05-28 00:21:07] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:21:07] [INFO ] Invariant cache hit.
[2024-05-28 00:21:08] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-28 00:21:08] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:21:08] [INFO ] Invariant cache hit.
[2024-05-28 00:21:09] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:21:14] [INFO ] Implicit Places using invariants and state equation in 6496 ms returned []
Implicit Place search using SMT with State Equation took 6954 ms to find 0 implicit places.
[2024-05-28 00:21:15] [INFO ] Redundant transitions in 130 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 00:21:15] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:21:15] [INFO ] Invariant cache hit.
[2024-05-28 00:21:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:21:51] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 2 ms to minimize.
[2024-05-28 00:21:51] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-28 00:21:52] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-28 00:21:52] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-28 00:21:52] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:21:53] [INFO ] Deduced a trap composed of 207 places in 554 ms of which 3 ms to minimize.
[2024-05-28 00:21:53] [INFO ] Deduced a trap composed of 182 places in 507 ms of which 6 ms to minimize.
[2024-05-28 00:21:54] [INFO ] Deduced a trap composed of 189 places in 454 ms of which 3 ms to minimize.
[2024-05-28 00:21:54] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:22:11] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 3 ms to minimize.
[2024-05-28 00:22:13] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 11/11 constraints]
After SMT, in 81865ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 81890ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/614 places, 2232/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158545 ms. Remains : 422/614 places, 2232/2424 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-02
Product exploration explored 100000 steps with 1965 reset in 834 ms.
Product exploration explored 100000 steps with 1990 reset in 958 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 97 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 431 steps (6 resets) in 12 ms. (33 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 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Applied a total of 0 rules in 81 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Running 2226 sub problems to find dead transitions.
[2024-05-28 00:22:39] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:22:39] [INFO ] Invariant cache hit.
[2024-05-28 00:22:39] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:23:19] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2024-05-28 00:23:19] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-05-28 00:23:19] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-28 00:23:19] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 3 ms to minimize.
[2024-05-28 00:23:19] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:23:20] [INFO ] Deduced a trap composed of 207 places in 583 ms of which 3 ms to minimize.
[2024-05-28 00:23:21] [INFO ] Deduced a trap composed of 182 places in 564 ms of which 3 ms to minimize.
[2024-05-28 00:23:21] [INFO ] Deduced a trap composed of 189 places in 558 ms of which 4 ms to minimize.
[2024-05-28 00:23:22] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:23:29] [INFO ] Deduced a trap composed of 49 places in 444 ms of which 3 ms to minimize.
[2024-05-28 00:23:31] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 11/11 constraints]
After SMT, in 65678ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 65715ms
[2024-05-28 00:23:45] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:23:45] [INFO ] Invariant cache hit.
[2024-05-28 00:23:45] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-28 00:23:45] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:23:45] [INFO ] Invariant cache hit.
[2024-05-28 00:23:46] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:23:52] [INFO ] Implicit Places using invariants and state equation in 6766 ms returned []
Implicit Place search using SMT with State Equation took 7243 ms to find 0 implicit places.
[2024-05-28 00:23:52] [INFO ] Redundant transitions in 35 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 00:23:52] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:23:52] [INFO ] Invariant cache hit.
[2024-05-28 00:23:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:24:28] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 2 ms to minimize.
[2024-05-28 00:24:28] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-28 00:24:28] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-28 00:24:28] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:24:28] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-28 00:24:29] [INFO ] Deduced a trap composed of 207 places in 577 ms of which 4 ms to minimize.
[2024-05-28 00:24:30] [INFO ] Deduced a trap composed of 182 places in 571 ms of which 3 ms to minimize.
[2024-05-28 00:24:30] [INFO ] Deduced a trap composed of 189 places in 564 ms of which 3 ms to minimize.
[2024-05-28 00:24:31] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:24:48] [INFO ] Deduced a trap composed of 49 places in 491 ms of which 4 ms to minimize.
[2024-05-28 00:24:51] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 11/11 constraints]
After SMT, in 81877ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 81900ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 155002 ms. Remains : 422/422 places, 2232/2232 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 130 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 120 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 346 steps (2 resets) in 6 ms. (49 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 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1943 reset in 656 ms.
Product exploration explored 100000 steps with 1963 reset in 653 ms.
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Applied a total of 0 rules in 57 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Running 2226 sub problems to find dead transitions.
[2024-05-28 00:25:16] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:25:16] [INFO ] Invariant cache hit.
[2024-05-28 00:25:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:25:58] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2024-05-28 00:25:58] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2024-05-28 00:25:58] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:25:58] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:25:58] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-05-28 00:25:59] [INFO ] Deduced a trap composed of 207 places in 592 ms of which 3 ms to minimize.
[2024-05-28 00:25:59] [INFO ] Deduced a trap composed of 182 places in 448 ms of which 2 ms to minimize.
[2024-05-28 00:26:00] [INFO ] Deduced a trap composed of 189 places in 440 ms of which 3 ms to minimize.
[2024-05-28 00:26:01] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 45 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:26:09] [INFO ] Deduced a trap composed of 49 places in 442 ms of which 2 ms to minimize.
[2024-05-28 00:26:15] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 11/11 constraints]
After SMT, in 68286ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 68309ms
[2024-05-28 00:26:24] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:26:24] [INFO ] Invariant cache hit.
[2024-05-28 00:26:25] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-28 00:26:25] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:26:25] [INFO ] Invariant cache hit.
[2024-05-28 00:26:26] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:26:32] [INFO ] Implicit Places using invariants and state equation in 7005 ms returned []
Implicit Place search using SMT with State Equation took 7509 ms to find 0 implicit places.
[2024-05-28 00:26:32] [INFO ] Redundant transitions in 180 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 00:26:32] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 00:26:32] [INFO ] Invariant cache hit.
[2024-05-28 00:26:32] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:27:26] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:27:27] [INFO ] Deduced a trap composed of 207 places in 598 ms of which 4 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 182 places in 513 ms of which 3 ms to minimize.
[2024-05-28 00:27:28] [INFO ] Deduced a trap composed of 189 places in 485 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 44 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 00:27:31] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:27:31] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 46 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 10/10 constraints]
After SMT, in 86611ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 86648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162729 ms. Remains : 422/422 places, 2232/2232 transitions.
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-02 finished in 481128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 37 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 32 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 00:27:59] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 00:27:59] [INFO ] Computed 42 invariants in 88 ms
[2024-05-28 00:27:59] [INFO ] State equation strengthened by 168 read => feed constraints.
(s479 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.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 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 10.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.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 1.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 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.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 1.0)
(s399 0.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 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.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 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 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 46970ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 47005ms
[2024-05-28 00:28:46] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:28:46] [INFO ] Invariant cache hit.
[2024-05-28 00:28:47] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-28 00:28:47] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:28:47] [INFO ] Invariant cache hit.
[2024-05-28 00:28:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:28:57] [INFO ] Implicit Places using invariants and state equation in 10315 ms returned []
Implicit Place search using SMT with State Equation took 10831 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 00:28:57] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:28:57] [INFO ] Invariant cache hit.
[2024-05-28 00:28:57] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:29:44] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 2 ms to minimize.
[2024-05-28 00:29:45] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 2 ms to minimize.
[2024-05-28 00:29:45] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-05-28 00:29:45] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-28 00:29:45] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:29:46] [INFO ] Deduced a trap composed of 350 places in 426 ms of which 3 ms to minimize.
[2024-05-28 00:29:46] [INFO ] Deduced a trap composed of 172 places in 407 ms of which 4 ms to minimize.
[2024-05-28 00:29:47] [INFO ] Deduced a trap composed of 177 places in 407 ms of which 4 ms to minimize.
[2024-05-28 00:29:47] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-28 00:29:50] [INFO ] Deduced a trap composed of 373 places in 637 ms of which 8 ms to minimize.
[2024-05-28 00:29:51] [INFO ] Deduced a trap composed of 368 places in 584 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 602/2990 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:29:58] [INFO ] Deduced a trap composed of 305 places in 413 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 48 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 12/12 constraints]
After SMT, in 87508ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 87544ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145430 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-07
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-07 finished in 145626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 54 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 614 transition count 2394
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 584 transition count 2388
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 578 transition count 2388
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 72 place count 578 transition count 2316
Deduced a syphon composed of 72 places in 12 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 216 place count 506 transition count 2316
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 288 place count 470 transition count 2280
Applied a total of 288 rules in 104 ms. Remains 470 /614 variables (removed 144) and now considering 2280/2424 (removed 144) transitions.
Running 2274 sub problems to find dead transitions.
[2024-05-28 00:30:25] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
// Phase 1: matrix 2244 rows 470 cols
[2024-05-28 00:30:25] [INFO ] Computed 42 invariants in 37 ms
[2024-05-28 00:30:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 00:31:01] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 2 ms to minimize.
[2024-05-28 00:31:01] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 2 ms to minimize.
[2024-05-28 00:31:01] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2024-05-28 00:31:01] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:31:01] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-28 00:31:02] [INFO ] Deduced a trap composed of 225 places in 352 ms of which 2 ms to minimize.
[2024-05-28 00:31:03] [INFO ] Deduced a trap composed of 199 places in 656 ms of which 4 ms to minimize.
[2024-05-28 00:31:04] [INFO ] Deduced a trap composed of 15 places in 625 ms of which 4 ms to minimize.
[2024-05-28 00:31:05] [INFO ] Deduced a trap composed of 230 places in 679 ms of which 3 ms to minimize.
[2024-05-28 00:31:05] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2024-05-28 00:31:07] [INFO ] Deduced a trap composed of 226 places in 499 ms of which 3 ms to minimize.
SMT process timed out in 42742ms, After SMT, problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 42765ms
[2024-05-28 00:31:07] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 00:31:07] [INFO ] Invariant cache hit.
[2024-05-28 00:31:08] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-28 00:31:08] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 00:31:08] [INFO ] Invariant cache hit.
[2024-05-28 00:31:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:31:20] [INFO ] Implicit Places using invariants and state equation in 11733 ms returned []
Implicit Place search using SMT with State Equation took 12612 ms to find 0 implicit places.
[2024-05-28 00:31:20] [INFO ] Redundant transitions in 80 ms returned []
Running 2274 sub problems to find dead transitions.
[2024-05-28 00:31:20] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 00:31:20] [INFO ] Invariant cache hit.
[2024-05-28 00:31:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-28 00:31:59] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 0 ms to minimize.
[2024-05-28 00:32:00] [INFO ] Deduced a trap composed of 231 places in 476 ms of which 3 ms to minimize.
[2024-05-28 00:32:00] [INFO ] Deduced a trap composed of 225 places in 485 ms of which 2 ms to minimize.
[2024-05-28 00:32:02] [INFO ] Deduced a trap composed of 40 places in 611 ms of which 2 ms to minimize.
[2024-05-28 00:32:02] [INFO ] Deduced a trap composed of 230 places in 636 ms of which 3 ms to minimize.
[2024-05-28 00:32:04] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 1 ms to minimize.
[2024-05-28 00:32:04] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 0 ms to minimize.
[2024-05-28 00:32:06] [INFO ] Deduced a trap composed of 221 places in 667 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2714 variables, and 48 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2274/1020 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 00:32:17] [INFO ] Deduced a trap composed of 218 places in 353 ms of which 3 ms to minimize.
[2024-05-28 00:32:44] [INFO ] Deduced a trap composed of 107 places in 420 ms of which 3 ms to minimize.
SMT process timed out in 83865ms, After SMT, problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 83905ms
Starting structural reductions in SI_LTL mode, iteration 1 : 470/614 places, 2280/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139502 ms. Remains : 470/614 places, 2280/2424 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-10 finished in 139604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((X(G(p1))&&(p2 U (p1||G(p2)))))&&p0))))'
Support contains 19 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 32 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-05-28 00:32:44] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 00:32:44] [INFO ] Computed 42 invariants in 43 ms
[2024-05-28 00:32:44] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 41700ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 41725ms
[2024-05-28 00:33:26] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:33:26] [INFO ] Invariant cache hit.
[2024-05-28 00:33:27] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-28 00:33:27] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:33:27] [INFO ] Invariant cache hit.
[2024-05-28 00:33:28] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:33:42] [INFO ] Implicit Places using invariants and state equation in 15295 ms returned []
Implicit Place search using SMT with State Equation took 15915 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 00:33:42] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 00:33:42] [INFO ] Invariant cache hit.
[2024-05-28 00:33:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:34:24] [INFO ] Deduced a trap composed of 84 places in 217 ms of which 3 ms to minimize.
[2024-05-28 00:34:24] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 2 ms to minimize.
[2024-05-28 00:34:25] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-28 00:34:25] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 0 ms to minimize.
[2024-05-28 00:34:25] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:34:26] [INFO ] Deduced a trap composed of 350 places in 557 ms of which 4 ms to minimize.
[2024-05-28 00:34:26] [INFO ] Deduced a trap composed of 172 places in 539 ms of which 4 ms to minimize.
[2024-05-28 00:34:27] [INFO ] Deduced a trap composed of 177 places in 499 ms of which 4 ms to minimize.
[2024-05-28 00:34:28] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:34:31] [INFO ] Deduced a trap composed of 373 places in 605 ms of which 4 ms to minimize.
[2024-05-28 00:34:31] [INFO ] Deduced a trap composed of 368 places in 521 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 47 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-05-28 00:34:37] [INFO ] Deduced a trap composed of 305 places in 497 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 9)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 48 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 12/12 constraints]
After SMT, in 81298ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 81322ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139011 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-12
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-12 finished in 139260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 614 transition count 2388
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 578 transition count 2388
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 578 transition count 2316
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 216 place count 506 transition count 2316
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 360 place count 434 transition count 2244
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 366 place count 428 transition count 2238
Iterating global reduction 2 with 6 rules applied. Total rules applied 372 place count 428 transition count 2238
Applied a total of 372 rules in 157 ms. Remains 428 /614 variables (removed 186) and now considering 2238/2424 (removed 186) transitions.
Running 2232 sub problems to find dead transitions.
[2024-05-28 00:35:04] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 428 cols
[2024-05-28 00:35:04] [INFO ] Computed 42 invariants in 102 ms
[2024-05-28 00:35:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 00:35:45] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2024-05-28 00:35:45] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-28 00:35:46] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-05-28 00:35:46] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 0 ms to minimize.
[2024-05-28 00:35:46] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:35:46] [INFO ] Deduced a trap composed of 199 places in 443 ms of which 2 ms to minimize.
[2024-05-28 00:35:47] [INFO ] Deduced a trap composed of 216 places in 444 ms of which 3 ms to minimize.
[2024-05-28 00:35:47] [INFO ] Deduced a trap composed of 207 places in 449 ms of which 4 ms to minimize.
[2024-05-28 00:35:48] [INFO ] Deduced a trap composed of 212 places in 427 ms of which 2 ms to minimize.
[2024-05-28 00:35:48] [INFO ] Deduced a trap composed of 197 places in 433 ms of which 2 ms to minimize.
[2024-05-28 00:35:49] [INFO ] Deduced a trap composed of 199 places in 439 ms of which 3 ms to minimize.
[2024-05-28 00:35:49] [INFO ] Deduced a trap composed of 200 places in 453 ms of which 2 ms to minimize.
[2024-05-28 00:35:50] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 49 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 00:35:57] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 50 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 14/14 constraints]
After SMT, in 67586ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 67622ms
[2024-05-28 00:36:11] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 00:36:11] [INFO ] Invariant cache hit.
[2024-05-28 00:36:12] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-28 00:36:12] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 00:36:12] [INFO ] Invariant cache hit.
[2024-05-28 00:36:13] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:36:20] [INFO ] Implicit Places using invariants and state equation in 7762 ms returned []
Implicit Place search using SMT with State Equation took 8387 ms to find 0 implicit places.
[2024-05-28 00:36:20] [INFO ] Redundant transitions in 62 ms returned []
Running 2232 sub problems to find dead transitions.
[2024-05-28 00:36:20] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 00:36:20] [INFO ] Invariant cache hit.
[2024-05-28 00:36:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
[2024-05-28 00:36:59] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-28 00:37:00] [INFO ] Deduced a trap composed of 188 places in 431 ms of which 3 ms to minimize.
[2024-05-28 00:37:01] [INFO ] Deduced a trap composed of 183 places in 517 ms of which 3 ms to minimize.
[2024-05-28 00:37:02] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 44 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 00:37:20] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 45 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 9/9 constraints]
After SMT, in 85648ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 85682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 428/614 places, 2238/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161937 ms. Remains : 428/614 places, 2238/2424 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 508 steps with 2 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-14 finished in 161992 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 7 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 614 transition count 2382
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 572 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 572 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 500 transition count 2310
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 384 place count 422 transition count 2232
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 416 transition count 2226
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 416 transition count 2226
Applied a total of 396 rules in 126 ms. Remains 416 /614 variables (removed 198) and now considering 2226/2424 (removed 198) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-28 00:37:46] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
// Phase 1: matrix 2190 rows 416 cols
[2024-05-28 00:37:46] [INFO ] Computed 42 invariants in 33 ms
[2024-05-28 00:37:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-28 00:38:18] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-28 00:38:19] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2024-05-28 00:38:19] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:38:19] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-28 00:38:19] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-28 00:38:19] [INFO ] Deduced a trap composed of 196 places in 399 ms of which 3 ms to minimize.
[2024-05-28 00:38:20] [INFO ] Deduced a trap composed of 177 places in 389 ms of which 3 ms to minimize.
[2024-05-28 00:38:20] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 0 ms to minimize.
[2024-05-28 00:38:22] [INFO ] Deduced a trap composed of 178 places in 335 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 45 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2220/966 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-28 00:38:34] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 2 ms to minimize.
[2024-05-28 00:38:34] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 47 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/966 constraints, Known Traps: 11/11 constraints]
After SMT, in 61431ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 61452ms
[2024-05-28 00:38:47] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-05-28 00:38:47] [INFO ] Invariant cache hit.
[2024-05-28 00:38:47] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-28 00:38:47] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-05-28 00:38:47] [INFO ] Invariant cache hit.
[2024-05-28 00:38:48] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:38:54] [INFO ] Implicit Places using invariants and state equation in 6301 ms returned []
Implicit Place search using SMT with State Equation took 6664 ms to find 0 implicit places.
[2024-05-28 00:38:54] [INFO ] Redundant transitions in 64 ms returned []
Running 2220 sub problems to find dead transitions.
[2024-05-28 00:38:54] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-05-28 00:38:54] [INFO ] Invariant cache hit.
[2024-05-28 00:38:54] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-28 00:39:29] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-28 00:39:29] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 0 ms to minimize.
[2024-05-28 00:39:29] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-28 00:39:29] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 0 ms to minimize.
[2024-05-28 00:39:29] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2024-05-28 00:39:30] [INFO ] Deduced a trap composed of 218 places in 437 ms of which 2 ms to minimize.
[2024-05-28 00:39:30] [INFO ] Deduced a trap composed of 192 places in 425 ms of which 2 ms to minimize.
[2024-05-28 00:39:31] [INFO ] Deduced a trap composed of 183 places in 421 ms of which 3 ms to minimize.
[2024-05-28 00:39:31] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:39:33] [INFO ] Deduced a trap composed of 178 places in 340 ms of which 2 ms to minimize.
[2024-05-28 00:39:34] [INFO ] Deduced a trap composed of 177 places in 403 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 47 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2220/966 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-28 00:39:49] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 48 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/966 constraints, Known Traps: 12/12 constraints]
After SMT, in 82666ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 82696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 416/614 places, 2226/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151035 ms. Remains : 416/614 places, 2226/2424 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-15
Stuttering criterion allowed to conclude after 145 steps with 7 reset in 9 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-15 finished in 151114 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)))'
[2024-05-28 00:40:17] [INFO ] Flatten gal took : 194 ms
[2024-05-28 00:40:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 00:40:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 614 places, 2424 transitions and 14814 arcs took 24 ms.
Total runtime 1434175 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J04T06

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 1658
MODEL NAME: /home/mcc/execution/419/model
614 places, 2424 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="PolyORBLF-COL-S06J04T06"
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 PolyORBLF-COL-S06J04T06, 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-171654445400179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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