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.r290-tajo-171654446500179.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 itstools
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 r290-tajo-171654446500179
=====================================================================

--------------------
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 1716910597752

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 15:36:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:36:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:36:39] [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 15:36:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:36:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 838 ms
[2024-05-28 15:36:40] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:36:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-28 15:36:40] [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 40003 steps (3890 resets) in 1306 ms. (30 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4003 steps (18 resets) in 80 ms. (49 steps per ms) remains 9/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (21 resets) in 19 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (14 resets) in 36 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4002 steps (21 resets) in 34 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000 steps (15 resets) in 18 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4001 steps (11 resets) in 17 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (18 resets) in 21 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 8/8 properties
[2024-05-28 15:36:41] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:36:41] [INFO ] Computed 26 invariants in 12 ms
[2024-05-28 15:36:41] [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 292 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 15:36:41] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 9 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 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 184 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 522ms 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 15:36:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 15:36:41] [INFO ] Flatten gal took : 37 ms
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:36:41] [INFO ] Flatten gal took : 9 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 15:36:41] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 209 ms.
[2024-05-28 15:36:41] [INFO ] Unfolded 9 HLPN properties in 1 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 133 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 15:36:42] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 620 cols
[2024-05-28 15:36:42] [INFO ] Computed 48 invariants in 156 ms
[2024-05-28 15:36:42] [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
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
[2024-05-28 15:37:22] [INFO ] Deduced a trap composed of 84 places in 230 ms of which 6 ms to minimize.
SMT process timed out in 40043ms, After SMT, problems are : Problem set: 0 solved, 2418 unsolved
Search for dead transitions found 0 dead transitions in 40081ms
[2024-05-28 15:37:22] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-05-28 15:37:22] [INFO ] Invariant cache hit.
[2024-05-28 15:37:22] [INFO ] Implicit Places using invariants in 469 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 483 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 23 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 40751 ms. Remains : 614/632 places, 2424/2430 transitions.
Support contains 158 out of 614 places after structural reductions.
[2024-05-28 15:37:23] [INFO ] Flatten gal took : 258 ms
[2024-05-28 15:37:23] [INFO ] Flatten gal took : 147 ms
[2024-05-28 15:37:23] [INFO ] Input system was already deterministic with 2424 transitions.
RANDOM walk for 40000 steps (245 resets) in 779 ms. (51 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40002 steps (115 resets) in 195 ms. (204 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (115 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (147 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (90 resets) in 296 ms. (134 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 144 ms. (275 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (102 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (106 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
[2024-05-28 15:37:24] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 614 cols
[2024-05-28 15:37:24] [INFO ] Computed 42 invariants in 44 ms
[2024-05-28 15:37:24] [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 15:37:25] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 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 1582 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 15:37:27] [INFO ] Deduced a trap composed of 85 places in 565 ms of which 5 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 85 places in 391 ms of which 3 ms to minimize.
[2024-05-28 15:37:27] [INFO ] Deduced a trap composed of 153 places in 422 ms of which 3 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 1646 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 3307ms 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 40 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 15:37:28] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 15:37:28] [INFO ] Computed 42 invariants in 89 ms
[2024-05-28 15:37:28] [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
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 20074 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 15:38:09] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:38:10] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:38:10] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:38:11] [INFO ] Deduced a trap composed of 153 places in 431 ms of which 3 ms to minimize.
[2024-05-28 15:38:11] [INFO ] Deduced a trap composed of 145 places in 357 ms of which 4 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 84 places in 456 ms of which 5 ms to minimize.
[2024-05-28 15:38:13] [INFO ] Deduced a trap composed of 344 places in 398 ms of which 3 ms to minimize.
[2024-05-28 15:38:16] [INFO ] Deduced a trap composed of 84 places in 387 ms of which 3 ms to minimize.
[2024-05-28 15:38:16] [INFO ] Deduced a trap composed of 63 places in 399 ms of which 2 ms to minimize.
[2024-05-28 15:38:27] [INFO ] Deduced a trap composed of 327 places in 607 ms of which 4 ms to minimize.
[2024-05-28 15:38:28] [INFO ] Deduced a trap composed of 85 places in 507 ms of which 3 ms to minimize.
SMT process timed out in 60289ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
[2024-05-28 15:38:28] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:38:28] [INFO ] Invariant cache hit.
[2024-05-28 15:38:29] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 15:38:29] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:38:29] [INFO ] Invariant cache hit.
[2024-05-28 15:38:29] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:38:41] [INFO ] Implicit Places using invariants and state equation in 12234 ms returned []
Implicit Place search using SMT with State Equation took 12804 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:38:41] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:38:41] [INFO ] Invariant cache hit.
[2024-05-28 15:38:41] [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 15:39:21] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2024-05-28 15:39:21] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:39:21] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:39:21] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:39:22] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 411 places in 522 ms of which 4 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 367 places in 499 ms of which 5 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 356 places in 372 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 137 places in 410 ms of which 4 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 176 places in 460 ms of which 4 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 314 places in 557 ms of which 5 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 338 places in 486 ms of which 4 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 388 places in 631 ms of which 5 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 350 places in 648 ms of which 5 ms to minimize.
[2024-05-28 15:39:31] [INFO ] Deduced a trap composed of 384 places in 556 ms of which 5 ms to minimize.
[2024-05-28 15:39:31] [INFO ] Deduced a trap composed of 385 places in 473 ms of which 4 ms to minimize.
SMT process timed out in 50693ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 50718ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123886 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 158 ms :[p0, p0]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1113 ms.
Product exploration explored 100000 steps with 50000 reset in 1079 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 28 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 126351 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 1 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 2 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 334 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 15:39:34] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2024-05-28 15:39:34] [INFO ] Computed 42 invariants in 35 ms
[2024-05-28 15:39:34] [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 15:40:07] [INFO ] Deduced a trap composed of 53 places in 405 ms of which 5 ms to minimize.
[2024-05-28 15:40:07] [INFO ] Deduced a trap composed of 79 places in 391 ms of which 2 ms to minimize.
[2024-05-28 15:40:07] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:40:07] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:40:07] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:40:08] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:40:08] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 2 ms to minimize.
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 189 places in 445 ms of which 2 ms to minimize.
[2024-05-28 15:40:09] [INFO ] Deduced a trap composed of 202 places in 352 ms of which 3 ms to minimize.
[2024-05-28 15:40:11] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 3 ms to minimize.
[2024-05-28 15:40:12] [INFO ] Deduced a trap composed of 184 places in 328 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20038 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: 11/11 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, 11/47 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:40:16] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 48 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20030 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: 12/12 constraints]
After SMT, in 59750ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 59776ms
[2024-05-28 15:40:34] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:40:34] [INFO ] Invariant cache hit.
[2024-05-28 15:40:35] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-28 15:40:35] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:40:35] [INFO ] Invariant cache hit.
[2024-05-28 15:40:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:40:44] [INFO ] Implicit Places using invariants and state equation in 9317 ms returned []
Implicit Place search using SMT with State Equation took 9867 ms to find 0 implicit places.
[2024-05-28 15:40:44] [INFO ] Redundant transitions in 141 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 15:40:44] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:40:44] [INFO ] Invariant cache hit.
[2024-05-28 15:40:44] [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 15:41:17] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:41:17] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:41:18] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:41:18] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:41:18] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
[2024-05-28 15:41:18] [INFO ] Deduced a trap composed of 223 places in 519 ms of which 4 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 199 places in 394 ms of which 2 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 190 places in 363 ms of which 2 ms to minimize.
[2024-05-28 15:41:20] [INFO ] Deduced a trap composed of 211 places in 457 ms of which 3 ms to minimize.
[2024-05-28 15:41:20] [INFO ] Deduced a trap composed of 189 places in 434 ms of which 3 ms to minimize.
[2024-05-28 15:41:22] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:41:24] [INFO ] Deduced a trap composed of 206 places in 538 ms of which 3 ms to minimize.
[2024-05-28 15:41:25] [INFO ] Deduced a trap composed of 15 places in 442 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30039 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: 13/13 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, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:41:38] [INFO ] Deduced a trap composed of 65 places in 451 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 50 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: 1254/972 constraints, Known Traps: 14/14 constraints]
After SMT, in 79141ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 79168ms
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 149307 ms. Remains : 422/614 places, 2232/2424 transitions.
Stuttering acceptance computed with spot in 67 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 569 ms.
Product exploration explored 100000 steps with 1977 reset in 560 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 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 362 steps (5 resets) in 8 ms. (40 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 80 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 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 44 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 15:42:05] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:42:05] [INFO ] Invariant cache hit.
[2024-05-28 15:42:05] [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 15:42:39] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:42:39] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:42:39] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:42:39] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:42:39] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:42:40] [INFO ] Deduced a trap composed of 223 places in 455 ms of which 2 ms to minimize.
[2024-05-28 15:42:40] [INFO ] Deduced a trap composed of 199 places in 408 ms of which 3 ms to minimize.
[2024-05-28 15:42:41] [INFO ] Deduced a trap composed of 190 places in 443 ms of which 3 ms to minimize.
[2024-05-28 15:42:41] [INFO ] Deduced a trap composed of 211 places in 467 ms of which 2 ms to minimize.
[2024-05-28 15:42:42] [INFO ] Deduced a trap composed of 189 places in 512 ms of which 2 ms to minimize.
[2024-05-28 15:42:43] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20041 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: 11/11 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, 11/47 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:42:50] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 3 ms to minimize.
[2024-05-28 15:42:51] [INFO ] Deduced a trap composed of 216 places in 301 ms of which 2 ms to minimize.
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 2 ms to minimize.
[2024-05-28 15:42:52] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 51 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20040 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: 15/15 constraints]
After SMT, in 60560ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
[2024-05-28 15:43:05] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:43:05] [INFO ] Invariant cache hit.
[2024-05-28 15:43:06] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-28 15:43:06] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:43:06] [INFO ] Invariant cache hit.
[2024-05-28 15:43:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:43:15] [INFO ] Implicit Places using invariants and state equation in 9404 ms returned []
Implicit Place search using SMT with State Equation took 9953 ms to find 0 implicit places.
[2024-05-28 15:43:16] [INFO ] Redundant transitions in 157 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 15:43:16] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:43:16] [INFO ] Invariant cache hit.
[2024-05-28 15:43: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 15:43:54] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:43:55] [INFO ] Deduced a trap composed of 223 places in 454 ms of which 2 ms to minimize.
[2024-05-28 15:43:55] [INFO ] Deduced a trap composed of 199 places in 432 ms of which 3 ms to minimize.
[2024-05-28 15:43:56] [INFO ] Deduced a trap composed of 190 places in 536 ms of which 4 ms to minimize.
[2024-05-28 15:43:56] [INFO ] Deduced a trap composed of 211 places in 477 ms of which 3 ms to minimize.
[2024-05-28 15:43:57] [INFO ] Deduced a trap composed of 189 places in 515 ms of which 2 ms to minimize.
[2024-05-28 15:43:58] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:44:01] [INFO ] Deduced a trap composed of 206 places in 521 ms of which 3 ms to minimize.
[2024-05-28 15:44:02] [INFO ] Deduced a trap composed of 15 places in 478 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 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: 13/13 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, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:44:16] [INFO ] Deduced a trap composed of 65 places in 394 ms of which 3 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 65 places in 467 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 51 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: 15/15 constraints]
After SMT, in 85960ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 85986ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 156746 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 82 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 331 steps (1 resets) in 9 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 100 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1932 reset in 726 ms.
Product exploration explored 100000 steps with 2039 reset in 558 ms.
Built C files in :
/tmp/ltsmin3974571475606728312
[2024-05-28 15:44:43] [INFO ] Too many transitions (2232) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:44:44] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3974571475606728312
Running compilation step : cd /tmp/ltsmin3974571475606728312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3974571475606728312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3974571475606728312;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 62 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 15:44:47] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:44:47] [INFO ] Invariant cache hit.
[2024-05-28 15:44:47] [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 15:45:18] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:45:18] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:45:18] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:45:18] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:45:18] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:45:19] [INFO ] Deduced a trap composed of 223 places in 555 ms of which 3 ms to minimize.
[2024-05-28 15:45:20] [INFO ] Deduced a trap composed of 199 places in 474 ms of which 2 ms to minimize.
[2024-05-28 15:45:20] [INFO ] Deduced a trap composed of 190 places in 501 ms of which 2 ms to minimize.
[2024-05-28 15:45:21] [INFO ] Deduced a trap composed of 211 places in 589 ms of which 3 ms to minimize.
[2024-05-28 15:45:21] [INFO ] Deduced a trap composed of 189 places in 518 ms of which 3 ms to minimize.
[2024-05-28 15:45:23] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:45:26] [INFO ] Deduced a trap composed of 206 places in 543 ms of which 3 ms to minimize.
SMT process timed out in 39115ms, After SMT, problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 39145ms
[2024-05-28 15:45:26] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:45:26] [INFO ] Invariant cache hit.
[2024-05-28 15:45:26] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 15:45:26] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:45:26] [INFO ] Invariant cache hit.
[2024-05-28 15:45:27] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:45:37] [INFO ] Implicit Places using invariants and state equation in 10742 ms returned []
Implicit Place search using SMT with State Equation took 11331 ms to find 0 implicit places.
[2024-05-28 15:45:37] [INFO ] Redundant transitions in 30 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-05-28 15:45:37] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-05-28 15:45:37] [INFO ] Invariant cache hit.
[2024-05-28 15:45:37] [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 15:46:11] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 223 places in 392 ms of which 2 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 199 places in 359 ms of which 2 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 190 places in 457 ms of which 3 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 211 places in 525 ms of which 3 ms to minimize.
[2024-05-28 15:46:14] [INFO ] Deduced a trap composed of 189 places in 449 ms of which 2 ms to minimize.
[2024-05-28 15:46:15] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:46:18] [INFO ] Deduced a trap composed of 206 places in 371 ms of which 2 ms to minimize.
[2024-05-28 15:46:19] [INFO ] Deduced a trap composed of 15 places in 458 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30039 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: 13/13 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, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-05-28 15:46:31] [INFO ] Deduced a trap composed of 65 places in 393 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 50 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30050 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: 14/14 constraints]
After SMT, in 80294ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 80315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 130904 ms. Remains : 422/422 places, 2232/2232 transitions.
Built C files in :
/tmp/ltsmin10703382854608397387
[2024-05-28 15:46:58] [INFO ] Too many transitions (2232) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:46:58] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10703382854608397387
Running compilation step : cd /tmp/ltsmin10703382854608397387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10703382854608397387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10703382854608397387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:47:01] [INFO ] Flatten gal took : 177 ms
[2024-05-28 15:47:01] [INFO ] Flatten gal took : 149 ms
[2024-05-28 15:47:01] [INFO ] Time to serialize gal into /tmp/LTL13136727640567260286.gal : 42 ms
[2024-05-28 15:47:01] [INFO ] Time to serialize properties into /tmp/LTL15719184944313512112.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13136727640567260286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11911550923155545281.hoa' '-atoms' '/tmp/LTL15719184944313512112.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15719184944313512112.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11911550923155545281.hoa
Detected timeout of ITS tools.
[2024-05-28 15:47:17] [INFO ] Flatten gal took : 98 ms
[2024-05-28 15:47:17] [INFO ] Flatten gal took : 96 ms
[2024-05-28 15:47:17] [INFO ] Time to serialize gal into /tmp/LTL1323542868277400274.gal : 15 ms
[2024-05-28 15:47:17] [INFO ] Time to serialize properties into /tmp/LTL17067993842548101148.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1323542868277400274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17067993842548101148.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((EnablePollingE_0+EnablePollingE_1)+(EnablePollingE_2+EnablePollingE_3))+(EnablePollingE_4+EnablePollingE_5))<=cPollingAbor...162
Formula 0 simplified : FG!"((((EnablePollingE_0+EnablePollingE_1)+(EnablePollingE_2+EnablePollingE_3))+(EnablePollingE_4+EnablePollingE_5))<=cPollingAbort)...156
Detected timeout of ITS tools.
[2024-05-28 15:47:32] [INFO ] Flatten gal took : 155 ms
[2024-05-28 15:47:32] [INFO ] Applying decomposition
[2024-05-28 15:47:32] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17040553718789083625.txt' '-o' '/tmp/graph17040553718789083625.bin' '-w' '/tmp/graph17040553718789083625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17040553718789083625.bin' '-l' '-1' '-v' '-w' '/tmp/graph17040553718789083625.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:47:32] [INFO ] Decomposing Gal with order
[2024-05-28 15:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:47:33] [INFO ] Removed a total of 733 redundant transitions.
[2024-05-28 15:47:33] [INFO ] Flatten gal took : 470 ms
[2024-05-28 15:47:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 28 ms.
[2024-05-28 15:47:34] [INFO ] Time to serialize gal into /tmp/LTL5621388966935157410.gal : 37 ms
[2024-05-28 15:47:34] [INFO ] Time to serialize properties into /tmp/LTL5525030024975972433.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5621388966935157410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5525030024975972433.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu1.EnablePollingE_0+gu1.EnablePollingE_1)+(gu1.EnablePollingE_2+gu1.EnablePollingE_3))+(gu1.EnablePollingE_4+gu1.EnablePo...190
Formula 0 simplified : FG!"((((gu1.EnablePollingE_0+gu1.EnablePollingE_1)+(gu1.EnablePollingE_2+gu1.EnablePollingE_3))+(gu1.EnablePollingE_4+gu1.EnablePoll...184
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-02 finished in 494736 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 50 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 15:47:49] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 15:47:49] [INFO ] Computed 42 invariants in 92 ms
[2024-05-28 15:47:49] [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 15:48:29] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 2 ms to minimize.
SMT process timed out in 40644ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40679ms
[2024-05-28 15:48:29] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:48:29] [INFO ] Invariant cache hit.
[2024-05-28 15:48:30] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-28 15:48:30] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:48:30] [INFO ] Invariant cache hit.
[2024-05-28 15:48:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:48:42] [INFO ] Implicit Places using invariants and state equation in 12138 ms returned []
Implicit Place search using SMT with State Equation took 12611 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:48:42] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:48:42] [INFO ] Invariant cache hit.
[2024-05-28 15:48: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 15:49:22] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 5 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 2 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 411 places in 589 ms of which 6 ms to minimize.
[2024-05-28 15:49:24] [INFO ] Deduced a trap composed of 367 places in 482 ms of which 4 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 356 places in 532 ms of which 4 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 137 places in 486 ms of which 4 ms to minimize.
[2024-05-28 15:49:26] [INFO ] Deduced a trap composed of 176 places in 489 ms of which 4 ms to minimize.
[2024-05-28 15:49:26] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-05-28 15:49:27] [INFO ] Deduced a trap composed of 314 places in 512 ms of which 4 ms to minimize.
[2024-05-28 15:49:28] [INFO ] Deduced a trap composed of 338 places in 497 ms of which 4 ms to minimize.
[2024-05-28 15:49:30] [INFO ] Deduced a trap composed of 388 places in 544 ms of which 4 ms to minimize.
[2024-05-28 15:49:31] [INFO ] Deduced a trap composed of 350 places in 535 ms of which 4 ms to minimize.
[2024-05-28 15:49:32] [INFO ] Deduced a trap composed of 384 places in 617 ms of which 4 ms to minimize.
SMT process timed out in 49512ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 49559ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102920 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 160 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 455 steps with 2 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-07 finished in 103119 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 2 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 123 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 15:49:32] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
// Phase 1: matrix 2244 rows 470 cols
[2024-05-28 15:49:32] [INFO ] Computed 42 invariants in 81 ms
[2024-05-28 15:49:32] [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 15:50:05] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
[2024-05-28 15:50:05] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 1 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:50:06] [INFO ] Deduced a trap composed of 220 places in 406 ms of which 4 ms to minimize.
[2024-05-28 15:50:07] [INFO ] Deduced a trap composed of 215 places in 431 ms of which 5 ms to minimize.
[2024-05-28 15:50:07] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:50:08] [INFO ] Deduced a trap composed of 220 places in 481 ms of which 4 ms to minimize.
[2024-05-28 15:50:09] [INFO ] Deduced a trap composed of 47 places in 326 ms of which 2 ms to minimize.
[2024-05-28 15:50:11] [INFO ] Deduced a trap composed of 226 places in 406 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2714 variables, and 47 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20034 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: 11/11 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, 11/47 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 15:50:15] [INFO ] Deduced a trap composed of 204 places in 392 ms of which 3 ms to minimize.
[2024-05-28 15:50:16] [INFO ] Deduced a trap composed of 217 places in 407 ms of which 4 ms to minimize.
[2024-05-28 15:50:17] [INFO ] Deduced a trap composed of 260 places in 565 ms of which 4 ms to minimize.
[2024-05-28 15:50:17] [INFO ] Deduced a trap composed of 236 places in 498 ms of which 3 ms to minimize.
[2024-05-28 15:50:20] [INFO ] Deduced a trap composed of 107 places in 461 ms of which 4 ms to minimize.
[2024-05-28 15:50:24] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 2 ms to minimize.
(s298 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(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 9)
(s105 0)
(s106 1)
(s107 1)
(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 0)
(s123 0)
(s124 0)
(s125 0)
(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 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(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 1)
(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 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 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 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 1)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2714 variables, and 53 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20042 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: 1254/1020 constraints, Known Traps: 17/17 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
[2024-05-28 15:50:32] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 15:50:32] [INFO ] Invariant cache hit.
[2024-05-28 15:50:33] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-28 15:50:33] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 15:50:33] [INFO ] Invariant cache hit.
[2024-05-28 15:50:33] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:50:40] [INFO ] Implicit Places using invariants and state equation in 7642 ms returned []
Implicit Place search using SMT with State Equation took 8224 ms to find 0 implicit places.
[2024-05-28 15:50:40] [INFO ] Redundant transitions in 76 ms returned []
Running 2274 sub problems to find dead transitions.
[2024-05-28 15:50:40] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-05-28 15:50:40] [INFO ] Invariant cache hit.
[2024-05-28 15:50:40] [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 15:51:15] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2024-05-28 15:51:15] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:51:15] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:51:15] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:51:15] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:51:15] [INFO ] Deduced a trap composed of 224 places in 456 ms of which 3 ms to minimize.
[2024-05-28 15:51:17] [INFO ] Deduced a trap composed of 225 places in 483 ms of which 3 ms to minimize.
[2024-05-28 15:51:17] [INFO ] Deduced a trap composed of 231 places in 430 ms of which 2 ms to minimize.
[2024-05-28 15:51:18] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:51:18] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2714 variables, and 46 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 30033 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: 10/10 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, 10/46 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-05-28 15:51:37] [INFO ] Deduced a trap composed of 188 places in 474 ms of which 4 ms to minimize.
[2024-05-28 15:51:38] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2714 variables, and 48 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 30038 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: 1254/1020 constraints, Known Traps: 12/12 constraints]
After SMT, in 79903ms problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 79933ms
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 148575 ms. Remains : 470/614 places, 2280/2424 transitions.
Stuttering acceptance computed with spot in 85 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 211 steps with 1 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-10 finished in 148685 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 25 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 15:52:00] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-05-28 15:52:01] [INFO ] Computed 42 invariants in 42 ms
[2024-05-28 15:52:01] [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 40547ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 40572ms
[2024-05-28 15:52:41] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:52:41] [INFO ] Invariant cache hit.
[2024-05-28 15:52:42] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-28 15:52:42] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:52:42] [INFO ] Invariant cache hit.
[2024-05-28 15:52:42] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:52:55] [INFO ] Implicit Places using invariants and state equation in 13833 ms returned []
Implicit Place search using SMT with State Equation took 14305 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-05-28 15:52:55] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-05-28 15:52:55] [INFO ] Invariant cache hit.
[2024-05-28 15:52:55] [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 15:53:38] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 2 ms to minimize.
[2024-05-28 15:53:38] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:53:38] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2024-05-28 15:53:38] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:53:38] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:53:39] [INFO ] Deduced a trap composed of 411 places in 513 ms of which 5 ms to minimize.
[2024-05-28 15:53:40] [INFO ] Deduced a trap composed of 367 places in 469 ms of which 3 ms to minimize.
[2024-05-28 15:53:40] [INFO ] Deduced a trap composed of 356 places in 478 ms of which 4 ms to minimize.
[2024-05-28 15:53:41] [INFO ] Deduced a trap composed of 137 places in 419 ms of which 3 ms to minimize.
[2024-05-28 15:53:41] [INFO ] Deduced a trap composed of 176 places in 384 ms of which 3 ms to minimize.
[2024-05-28 15:53:42] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:53:43] [INFO ] Deduced a trap composed of 314 places in 465 ms of which 4 ms to minimize.
[2024-05-28 15:53:43] [INFO ] Deduced a trap composed of 338 places in 481 ms of which 3 ms to minimize.
[2024-05-28 15:53:46] [INFO ] Deduced a trap composed of 388 places in 643 ms of which 3 ms to minimize.
SMT process timed out in 50638ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 50666ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105580 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 197 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 36 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-12 finished in 105804 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 2 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 1 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 97 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 15:53:46] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 428 cols
[2024-05-28 15:53:46] [INFO ] Computed 42 invariants in 42 ms
[2024-05-28 15:53:46] [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 15:54:20] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:54:20] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
[2024-05-28 15:54:20] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:54:20] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 189 places in 477 ms of which 2 ms to minimize.
[2024-05-28 15:54:22] [INFO ] Deduced a trap composed of 183 places in 530 ms of which 3 ms to minimize.
[2024-05-28 15:54:23] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 1 ms to minimize.
[2024-05-28 15:54:23] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 45 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20053 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: 9/9 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, 9/45 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:54:30] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-05-28 15:54:33] [INFO ] Deduced a trap composed of 184 places in 395 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(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 9)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 47 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20030 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: 11/11 constraints]
After SMT, in 59753ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 59774ms
[2024-05-28 15:54:46] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:54:46] [INFO ] Invariant cache hit.
[2024-05-28 15:54:47] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-28 15:54:47] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:54:47] [INFO ] Invariant cache hit.
[2024-05-28 15:54:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:54:52] [INFO ] Implicit Places using invariants and state equation in 5552 ms returned []
Implicit Place search using SMT with State Equation took 6005 ms to find 0 implicit places.
[2024-05-28 15:54:52] [INFO ] Redundant transitions in 62 ms returned []
Running 2232 sub problems to find dead transitions.
[2024-05-28 15:54:52] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-05-28 15:54:52] [INFO ] Invariant cache hit.
[2024-05-28 15:54:52] [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 15:55:28] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:55:28] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:55:28] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:55:28] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:55:28] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:55:29] [INFO ] Deduced a trap composed of 189 places in 528 ms of which 2 ms to minimize.
[2024-05-28 15:55:30] [INFO ] Deduced a trap composed of 178 places in 537 ms of which 4 ms to minimize.
[2024-05-28 15:55:30] [INFO ] Deduced a trap composed of 183 places in 448 ms of which 3 ms to minimize.
[2024-05-28 15:55:31] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 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 422/2630 variables, and 45 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30033 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: 9/9 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, 9/45 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-05-28 15:55:51] [INFO ] Deduced a trap composed of 184 places in 433 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 46 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30048 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: 10/10 constraints]
After SMT, in 80678ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 80705ms
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 146661 ms. Remains : 428/614 places, 2238/2424 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-14 finished in 146737 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 1 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 146 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 15:56:13] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
// Phase 1: matrix 2190 rows 416 cols
[2024-05-28 15:56:13] [INFO ] Computed 42 invariants in 74 ms
[2024-05-28 15:56:13] [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 15:56:44] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:56:44] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:56:44] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:56:44] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:56:44] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:56:45] [INFO ] Deduced a trap composed of 188 places in 459 ms of which 3 ms to minimize.
[2024-05-28 15:56:47] [INFO ] Deduced a trap composed of 52 places in 426 ms of which 3 ms to minimize.
[2024-05-28 15:56:48] [INFO ] Deduced a trap composed of 178 places in 476 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 44 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20031 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: 8/8 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, 8/44 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-05-28 15:56:56] [INFO ] Deduced a trap composed of 15 places in 616 ms of which 3 ms to minimize.
[2024-05-28 15:56:56] [INFO ] Deduced a trap composed of 177 places in 538 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 Int declared 410/2606 variables, and 46 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20031 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: 10/10 constraints]
After SMT, in 59312ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 59339ms
[2024-05-28 15:57:12] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-05-28 15:57:12] [INFO ] Invariant cache hit.
[2024-05-28 15:57:13] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-28 15:57:13] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-05-28 15:57:13] [INFO ] Invariant cache hit.
[2024-05-28 15:57:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:57:19] [INFO ] Implicit Places using invariants and state equation in 6199 ms returned []
Implicit Place search using SMT with State Equation took 6605 ms to find 0 implicit places.
[2024-05-28 15:57:19] [INFO ] Redundant transitions in 60 ms returned []
Running 2220 sub problems to find dead transitions.
[2024-05-28 15:57:19] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-05-28 15:57:19] [INFO ] Invariant cache hit.
[2024-05-28 15:57:19] [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 15:57:57] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:57:57] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:57:57] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:57:57] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:57:57] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:57:58] [INFO ] Deduced a trap composed of 188 places in 505 ms of which 3 ms to minimize.
[2024-05-28 15:57:58] [INFO ] Deduced a trap composed of 182 places in 533 ms of which 3 ms to minimize.
[2024-05-28 15:57:59] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 2 ms to minimize.
[2024-05-28 15:57:59] [INFO ] Deduced a trap composed of 177 places in 437 ms of which 2 ms to minimize.
[2024-05-28 15:57:59] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:58:02] [INFO ] Deduced a trap composed of 142 places in 429 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 410/2606 variables, and 47 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30030 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 15:58:44] [INFO ] Deduced a trap composed of 132 places in 384 ms of which 3 ms to minimize.
[2024-05-28 15:58:45] [INFO ] Deduced a trap composed of 130 places in 430 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(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 10)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(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 1)
(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 1)
(s184 1)
(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 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(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 1)
(s235 1)
(s236 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 49 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30028 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: 13/13 constraints]
After SMT, in 86149ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 86184ms
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 152355 ms. Remains : 416/614 places, 2226/2424 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-15
Stuttering criterion allowed to conclude after 7646 steps with 161 reset in 77 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-15 finished in 152535 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 15:58:46] [INFO ] Flatten gal took : 287 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16780553007742382677
[2024-05-28 15:58:46] [INFO ] Too many transitions (2424) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:58:46] [INFO ] Applying decomposition
[2024-05-28 15:58:46] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16780553007742382677
Running compilation step : cd /tmp/ltsmin16780553007742382677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 15:58:46] [INFO ] Flatten gal took : 163 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7497159268354935088.txt' '-o' '/tmp/graph7497159268354935088.bin' '-w' '/tmp/graph7497159268354935088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7497159268354935088.bin' '-l' '-1' '-v' '-w' '/tmp/graph7497159268354935088.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:58:47] [INFO ] Decomposing Gal with order
[2024-05-28 15:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:58:47] [INFO ] Removed a total of 780 redundant transitions.
[2024-05-28 15:58:47] [INFO ] Flatten gal took : 362 ms
[2024-05-28 15:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 316 labels/synchronizations in 25 ms.
[2024-05-28 15:58:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality11223932274541227164.gal : 17 ms
[2024-05-28 15:58:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality12952658384534528886.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11223932274541227164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12952658384534528886.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu15.EnablePollingE_0+gu15.EnablePollingE_1)+(gu15.EnablePollingE_2+gu15.EnablePollingE_3))+(gu15.EnablePollingE_4+gu15.En...197
Formula 0 simplified : FG!"((((gu15.EnablePollingE_0+gu15.EnablePollingE_1)+(gu15.EnablePollingE_2+gu15.EnablePollingE_3))+(gu15.EnablePollingE_4+gu15.Enab...191
Compilation finished in 6843 ms.
Running link step : cd /tmp/ltsmin16780553007742382677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16780553007742382677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 16:16:59] [INFO ] Applying decomposition
[2024-05-28 16:16:59] [INFO ] Flatten gal took : 289 ms
[2024-05-28 16:16:59] [INFO ] Decomposing Gal with order
[2024-05-28 16:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:17:00] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[DataOnSrc_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, ModifiedSrc_1, AbourtToModifySrc_1],[DataOnSrc_2, ModifiedSrc_2, AbourtToModifySrc_2],[DataOnSrc_3, ModifiedSrc_3, AbourtToModifySrc_3],[DataOnSrc_4, ModifiedSrc_4, AbourtToModifySrc_4],[DataOnSrc_5, ModifiedSrc_5, AbourtToModifySrc_5],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],[DisablePollingE_20, DisablePollingB_20, Insert_Source_B_20, P_1119_20, P_2579_20],[DisablePollingE_21, DisablePollingB_21, Insert_Source_B_21, P_1119_21, P_2579_21],[DisablePollingE_22, DisablePollingB_22, Insert_Source_B_22, P_1119_22, P_2579_22],[DisablePollingE_23, DisablePollingB_23, Insert_Source_B_23, P_1119_23, P_2579_23],[DisablePollingE_24, DisablePollingB_24, Insert_Source_B_24, P_1119_24, P_2579_24],[DisablePollingE_25, DisablePollingB_25, Insert_Source_B_25, P_1119_25, P_2579_25],[DisablePollingE_26, DisablePollingB_26, Insert_Source_B_26, P_1119_26, P_2579_26],[DisablePollingE_27, DisablePollingB_27, Insert_Source_B_27, P_1119_27, P_2579_27],[DisablePollingE_28, DisablePollingB_28, Insert_Source_B_28, P_1119_28, P_2579_28],[DisablePollingE_29, DisablePollingB_29, Insert_Source_B_29, P_1119_29, P_2579_29],[DisablePollingE_30, DisablePollingB_30, Insert_Source_B_30, P_1119_30, P_2579_30],[DisablePollingE_31, DisablePollingB_31, Insert_Source_B_31, P_1119_31, P_2579_31],[DisablePollingE_32, DisablePollingB_32, Insert_Source_B_32, P_1119_32, P_2579_32],[DisablePollingE_33, DisablePollingB_33, Insert_Source_B_33, P_1119_33, P_2579_33],[DisablePollingE_34, DisablePollingB_34, Insert_Source_B_34, P_1119_34, P_2579_34],[DisablePollingE_35, DisablePollingB_35, Insert_Source_B_35, P_1119_35, P_2579_35],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 16:17:00] [INFO ] Flatten gal took : 346 ms
[2024-05-28 16:17:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality16894295636092606526.gal : 104 ms
[2024-05-28 16:17:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality7668811832584389273.ltl : 48 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16894295636092606526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7668811832584389273.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((((EnablePollingE_0+EnablePollingE_1)+(EnablePollingE_2+EnablePollingE_3))+(EnablePollingE_4+EnablePollingE_5))<=cPollingAbor...162
Formula 0 simplified : FG!"((((EnablePollingE_0+EnablePollingE_1)+(EnablePollingE_2+EnablePollingE_3))+(EnablePollingE_4+EnablePollingE_5))<=cPollingAbort)...156

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r290-tajo-171654446500179"
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 ;