MCC'2024- Execution of r290-tajo-171654446400107

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
14135.443	3600000.00	10569707.00	532.60	?FFTTFFFTFFTFFFF	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400107.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-S02J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 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.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 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-S02J06T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716906491598

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-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 14:28:13] [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 14:28:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:28:13] [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 14:28:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:28:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 639 ms
[2024-05-28 14:28:13] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 14:28:13] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 14:28:13] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (19 resets) in 2202 ms. (18 steps per ms) remains 11/29 properties
BEST_FIRST walk for 40000 steps (8 resets) in 440 ms. (90 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (13 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (13 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 212 ms. (187 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (12 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (10 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (10 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (11 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
[2024-05-28 14:28:15] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:28:15] [INFO ] Computed 26 invariants in 15 ms
[2024-05-28 14:28:15] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 2 (OVERLAPS) 36/48 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/53 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 73/145 variables, and 21 constraints, problems are : Problem set: 10 solved, 0 unsolved in 364 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: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:28:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 14:28:16] [INFO ] Flatten gal took : 31 ms
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 14:28:16] [INFO ] Flatten gal took : 12 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:28:16] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 34 ms.
[2024-05-28 14:28:16] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 313 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 688 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 680 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 680 transition count 1298
Applied a total of 18 rules in 58 ms. Remains 680 /690 variables (removed 10) and now considering 1298/1306 (removed 8) transitions.
Running 1296 sub problems to find dead transitions.
[2024-05-28 14:28:16] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 680 cols
[2024-05-28 14:28:16] [INFO ] Computed 52 invariants in 58 ms
[2024-05-28 14:28:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/678 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:28:34] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 25 ms to minimize.
[2024-05-28 14:28:37] [INFO ] Deduced a trap composed of 96 places in 408 ms of which 8 ms to minimize.
[2024-05-28 14:28:37] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:28:37] [INFO ] Deduced a trap composed of 72 places in 266 ms of which 5 ms to minimize.
[2024-05-28 14:28:38] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-05-28 14:28:38] [INFO ] Deduced a trap composed of 74 places in 269 ms of which 4 ms to minimize.
SMT process timed out in 22214ms, After SMT, problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 22235ms
[2024-05-28 14:28:38] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:28:38] [INFO ] Invariant cache hit.
[2024-05-28 14:28:38] [INFO ] Implicit Places using invariants in 376 ms returned [530, 531, 532, 533, 534, 535, 536, 537]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 391 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 672/690 places, 1298/1306 transitions.
Applied a total of 0 rules in 15 ms. Remains 672 /672 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22743 ms. Remains : 672/690 places, 1298/1306 transitions.
Support contains 313 out of 672 places after structural reductions.
[2024-05-28 14:28:39] [INFO ] Flatten gal took : 125 ms
[2024-05-28 14:28:39] [INFO ] Flatten gal took : 95 ms
[2024-05-28 14:28:39] [INFO ] Input system was already deterministic with 1298 transitions.
Support contains 305 out of 672 places (down from 313) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 820 ms. (48 steps per ms) remains 9/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (10 resets) in 357 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 284 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 283 ms. (140 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (12 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
[2024-05-28 14:28:40] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 672 cols
[2024-05-28 14:28:40] [INFO ] Computed 44 invariants in 32 ms
[2024-05-28 14:28:40] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 415/582 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/585 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 668/1954 variables, and 41 constraints, problems are : Problem set: 8 solved, 0 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 383ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 10 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' '!(G(F(p0)))'
Support contains 9 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 672 transition count 1250
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 624 transition count 1250
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1170
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 544 transition count 1170
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 384 place count 480 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 472 transition count 1098
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 472 transition count 1098
Applied a total of 400 rules in 123 ms. Remains 472 /672 variables (removed 200) and now considering 1098/1298 (removed 200) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:28:41] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 472 cols
[2024-05-28 14:28:41] [INFO ] Computed 44 invariants in 35 ms
[2024-05-28 14:28:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 6 ms to minimize.
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:28:50] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:28:51] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:28:51] [INFO ] Deduced a trap composed of 181 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:28:51] [INFO ] Deduced a trap composed of 182 places in 301 ms of which 4 ms to minimize.
[2024-05-28 14:28:52] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:28:58] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1554 variables, and 53 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:29:11] [INFO ] Deduced a trap composed of 300 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:29:12] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:29:15] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 3 ms to minimize.
[2024-05-28 14:29:19] [INFO ] Deduced a trap composed of 174 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:29:21] [INFO ] Deduced a trap composed of 163 places in 284 ms of which 4 ms to minimize.
[2024-05-28 14:29:22] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:29:22] [INFO ] Deduced a trap composed of 87 places in 305 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1554 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 18/18 constraints]
After SMT, in 41859ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41874ms
[2024-05-28 14:29:23] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:29:23] [INFO ] Invariant cache hit.
[2024-05-28 14:29:23] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-28 14:29:23] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:29:23] [INFO ] Invariant cache hit.
[2024-05-28 14:29:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:29:28] [INFO ] Implicit Places using invariants and state equation in 5098 ms returned []
Implicit Place search using SMT with State Equation took 5639 ms to find 0 implicit places.
[2024-05-28 14:29:28] [INFO ] Redundant transitions in 78 ms returned []
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:29:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:29:29] [INFO ] Invariant cache hit.
[2024-05-28 14:29:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:29:39] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 4 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:29:40] [INFO ] Deduced a trap composed of 182 places in 322 ms of which 5 ms to minimize.
[2024-05-28 14:29:41] [INFO ] Deduced a trap composed of 175 places in 314 ms of which 3 ms to minimize.
[2024-05-28 14:29:42] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:29:44] [INFO ] Deduced a trap composed of 300 places in 303 ms of which 6 ms to minimize.
[2024-05-28 14:29:47] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:29:51] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:29:51] [INFO ] Deduced a trap composed of 166 places in 305 ms of which 5 ms to minimize.
[2024-05-28 14:29:52] [INFO ] Deduced a trap composed of 179 places in 288 ms of which 5 ms to minimize.
[2024-05-28 14:29:52] [INFO ] Deduced a trap composed of 171 places in 319 ms of which 7 ms to minimize.
[2024-05-28 14:29:53] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 5 ms to minimize.
[2024-05-28 14:29:53] [INFO ] Deduced a trap composed of 89 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1554 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:30:06] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 174 places in 331 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1554 variables, and 62 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 20/20 constraints]
After SMT, in 61750ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61767ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/672 places, 1098/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109534 ms. Remains : 472/672 places, 1098/1298 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-00
Product exploration explored 100000 steps with 6475 reset in 424 ms.
Product exploration explored 100000 steps with 6477 reset in 355 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 69 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 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)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:30:32] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:30:32] [INFO ] Invariant cache hit.
[2024-05-28 14:30:41] [INFO ] [Real]Absence check using 13 positive place invariants in 99 ms returned sat
[2024-05-28 14:30:41] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 247 ms returned sat
[2024-05-28 14:30:46] [INFO ] [Real]Absence check using state equation in 4387 ms returned sat
[2024-05-28 14:30:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 32 ms returned sat
[2024-05-28 14:30:47] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 78 ms returned sat
[2024-05-28 14:30:48] [INFO ] [Nat]Absence check using state equation in 1902 ms returned sat
[2024-05-28 14:30:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:30:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 268 ms returned sat
[2024-05-28 14:30:49] [INFO ] Computed and/alt/rep : 424/1469/416 causal constraints (skipped 664 transitions) in 108 ms.
[2024-05-28 14:30:51] [INFO ] Added : 90 causal constraints over 18 iterations in 2366 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 1098/1098 transitions.
Applied a total of 0 rules in 46 ms. Remains 472 /472 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:30:51] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:30:51] [INFO ] Invariant cache hit.
[2024-05-28 14:30:51] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:31:00] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:31:00] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 13 ms to minimize.
[2024-05-28 14:31:01] [INFO ] Deduced a trap composed of 182 places in 282 ms of which 3 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 175 places in 276 ms of which 3 ms to minimize.
[2024-05-28 14:31:03] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:31:06] [INFO ] Deduced a trap composed of 300 places in 276 ms of which 4 ms to minimize.
[2024-05-28 14:31:09] [INFO ] Deduced a trap composed of 54 places in 320 ms of which 5 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:31:13] [INFO ] Deduced a trap composed of 166 places in 315 ms of which 5 ms to minimize.
SMT process timed out in 21746ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 21761ms
[2024-05-28 14:31:13] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:31:13] [INFO ] Invariant cache hit.
[2024-05-28 14:31:13] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-28 14:31:13] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:31:13] [INFO ] Invariant cache hit.
[2024-05-28 14:31:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:31:18] [INFO ] Implicit Places using invariants and state equation in 4985 ms returned []
Implicit Place search using SMT with State Equation took 5456 ms to find 0 implicit places.
[2024-05-28 14:31:19] [INFO ] Redundant transitions in 101 ms returned []
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:31:19] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:31:19] [INFO ] Invariant cache hit.
[2024-05-28 14:31:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 4 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 2 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 182 places in 287 ms of which 3 ms to minimize.
[2024-05-28 14:31:29] [INFO ] Deduced a trap composed of 175 places in 291 ms of which 3 ms to minimize.
[2024-05-28 14:31:31] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:31:33] [INFO ] Deduced a trap composed of 300 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:31:37] [INFO ] Deduced a trap composed of 54 places in 283 ms of which 3 ms to minimize.
[2024-05-28 14:31:40] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:31:41] [INFO ] Deduced a trap composed of 166 places in 324 ms of which 3 ms to minimize.
[2024-05-28 14:31:41] [INFO ] Deduced a trap composed of 179 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:31:42] [INFO ] Deduced a trap composed of 171 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 89 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1554 variables, and 60 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:31:55] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:32:02] [INFO ] Deduced a trap composed of 174 places in 270 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/472 variables, 2/64 constraints. Problems are: Problem set: 88 solved, 1008 unsolved
[2024-05-28 14:32:14] [INFO ] Deduced a trap composed of 101 places in 307 ms of which 4 ms to minimize.
[2024-05-28 14:32:15] [INFO ] Deduced a trap composed of 170 places in 266 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1554 variables, and 66 constraints, problems are : Problem set: 88 solved, 1008 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 61744ms problems are : Problem set: 88 solved, 1008 unsolved
Search for dead transitions found 88 dead transitions in 61760ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 472/472 places, 1010/1098 transitions.
Reduce places removed 2 places and 16 transitions.
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 454 transition count 978
Applied a total of 16 rules in 48 ms. Remains 454 /472 variables (removed 18) and now considering 978/1010 (removed 32) transitions.
[2024-05-28 14:32:20] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 454 cols
[2024-05-28 14:32:20] [INFO ] Computed 44 invariants in 26 ms
[2024-05-28 14:32:21] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-28 14:32:21] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2024-05-28 14:32:21] [INFO ] Invariant cache hit.
[2024-05-28 14:32:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:32:34] [INFO ] Implicit Places using invariants and state equation in 12859 ms returned []
Implicit Place search using SMT with State Equation took 13419 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 454/472 places, 978/1098 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102646 ms. Remains : 454/472 places, 978/1098 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 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 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-05-28 14:32:34] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2024-05-28 14:32:34] [INFO ] Invariant cache hit.
[2024-05-28 14:32:35] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:32:35] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 253 ms returned sat
[2024-05-28 14:32:37] [INFO ] [Real]Absence check using state equation in 1584 ms returned sat
[2024-05-28 14:32:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:32:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:32:38] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 71 ms returned sat
[2024-05-28 14:32:38] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2024-05-28 14:32:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:32:39] [INFO ] [Nat]Added 96 Read/Feed constraints in 139 ms returned sat
[2024-05-28 14:32:39] [INFO ] Computed and/alt/rep : 440/1517/432 causal constraints (skipped 528 transitions) in 83 ms.
[2024-05-28 14:32:40] [INFO ] Added : 125 causal constraints over 25 iterations in 1527 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6400 reset in 347 ms.
Product exploration explored 100000 steps with 6428 reset in 250 ms.
Built C files in :
/tmp/ltsmin1493550176904597604
[2024-05-28 14:32:41] [INFO ] Computing symmetric may disable matrix : 978 transitions.
[2024-05-28 14:32:41] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:32:41] [INFO ] Computing symmetric may enable matrix : 978 transitions.
[2024-05-28 14:32:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:32:41] [INFO ] Computing Do-Not-Accords matrix : 978 transitions.
[2024-05-28 14:32:41] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:32:41] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1493550176904597604
Running compilation step : cd /tmp/ltsmin1493550176904597604;'/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/ltsmin1493550176904597604;'/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/ltsmin1493550176904597604;'/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 9 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 978/978 transitions.
Applied a total of 0 rules in 63 ms. Remains 454 /454 variables (removed 0) and now considering 978/978 (removed 0) transitions.
Running 976 sub problems to find dead transitions.
[2024-05-28 14:32:44] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2024-05-28 14:32:44] [INFO ] Invariant cache hit.
[2024-05-28 14:32:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:32:53] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:32:54] [INFO ] Deduced a trap composed of 184 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:32:54] [INFO ] Deduced a trap composed of 192 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:32:54] [INFO ] Deduced a trap composed of 191 places in 256 ms of which 5 ms to minimize.
[2024-05-28 14:32:54] [INFO ] Deduced a trap composed of 204 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:32:55] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 2 ms to minimize.
[2024-05-28 14:32:55] [INFO ] Deduced a trap composed of 189 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:32:55] [INFO ] Deduced a trap composed of 204 places in 264 ms of which 3 ms to minimize.
[2024-05-28 14:32:55] [INFO ] Deduced a trap composed of 210 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:32:56] [INFO ] Deduced a trap composed of 194 places in 274 ms of which 5 ms to minimize.
[2024-05-28 14:32:56] [INFO ] Deduced a trap composed of 188 places in 286 ms of which 6 ms to minimize.
[2024-05-28 14:32:56] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 4 ms to minimize.
[2024-05-28 14:32:57] [INFO ] Deduced a trap composed of 200 places in 280 ms of which 5 ms to minimize.
[2024-05-28 14:32:57] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:32:58] [INFO ] Deduced a trap composed of 46 places in 387 ms of which 1 ms to minimize.
[2024-05-28 14:32:58] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 188 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:32:59] [INFO ] Deduced a trap composed of 191 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:33:00] [INFO ] Deduced a trap composed of 183 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:33:00] [INFO ] Deduced a trap composed of 174 places in 246 ms of which 2 ms to minimize.
[2024-05-28 14:33:00] [INFO ] Deduced a trap composed of 184 places in 248 ms of which 2 ms to minimize.
[2024-05-28 14:33:00] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:33:01] [INFO ] Deduced a trap composed of 199 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:33:01] [INFO ] Deduced a trap composed of 187 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:33:01] [INFO ] Deduced a trap composed of 169 places in 257 ms of which 3 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 189 places in 234 ms of which 2 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 216 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 2 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 195 places in 200 ms of which 4 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 184 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 192 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 191 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 976 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/1416 variables, and 82 constraints, problems are : Problem set: 0 solved, 976 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/454 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 976/976 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 976 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 40/82 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 206 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 183 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 207 places in 272 ms of which 5 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 186 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 225 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 222 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 192 places in 281 ms of which 5 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 204 places in 267 ms of which 5 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 225 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 213 places in 273 ms of which 5 ms to minimize.
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 225 places in 270 ms of which 6 ms to minimize.
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 224 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 223 places in 213 ms of which 4 ms to minimize.
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 221 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 216 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 230 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 226 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 204 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 247 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:33:13] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:33:14] [INFO ] Deduced a trap composed of 189 places in 165 ms of which 2 ms to minimize.
[2024-05-28 14:33:14] [INFO ] Deduced a trap composed of 210 places in 209 ms of which 4 ms to minimize.
[2024-05-28 14:33:14] [INFO ] Deduced a trap composed of 180 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:33:15] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 14:33:15] [INFO ] Deduced a trap composed of 207 places in 307 ms of which 6 ms to minimize.
[2024-05-28 14:33:15] [INFO ] Deduced a trap composed of 210 places in 313 ms of which 7 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 189 places in 302 ms of which 7 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 210 places in 306 ms of which 6 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 189 places in 222 ms of which 2 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 193 places in 314 ms of which 6 ms to minimize.
[2024-05-28 14:33:17] [INFO ] Deduced a trap composed of 210 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:33:17] [INFO ] Deduced a trap composed of 190 places in 307 ms of which 5 ms to minimize.
[2024-05-28 14:33:17] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 3 ms to minimize.
[2024-05-28 14:33:18] [INFO ] Deduced a trap composed of 212 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:33:18] [INFO ] Deduced a trap composed of 184 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:33:18] [INFO ] Deduced a trap composed of 186 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:33:18] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 8 ms to minimize.
[2024-05-28 14:33:19] [INFO ] Deduced a trap composed of 227 places in 271 ms of which 3 ms to minimize.
[2024-05-28 14:33:19] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:33:26] [INFO ] Deduced a trap composed of 193 places in 7184 ms of which 30 ms to minimize.
SMT process timed out in 41909ms, After SMT, problems are : Problem set: 0 solved, 976 unsolved
Search for dead transitions found 0 dead transitions in 41933ms
[2024-05-28 14:33:26] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2024-05-28 14:33:26] [INFO ] Invariant cache hit.
[2024-05-28 14:33:27] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-28 14:33:27] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2024-05-28 14:33:27] [INFO ] Invariant cache hit.
[2024-05-28 14:33:28] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:33:34] [INFO ] Implicit Places using invariants and state equation in 6598 ms returned []
Implicit Place search using SMT with State Equation took 7273 ms to find 0 implicit places.
[2024-05-28 14:33:34] [INFO ] Redundant transitions in 9 ms returned []
Running 976 sub problems to find dead transitions.
[2024-05-28 14:33:34] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2024-05-28 14:33:34] [INFO ] Invariant cache hit.
[2024-05-28 14:33:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 976 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 184 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:33:45] [INFO ] Deduced a trap composed of 192 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:33:46] [INFO ] Deduced a trap composed of 191 places in 192 ms of which 2 ms to minimize.
[2024-05-28 14:33:46] [INFO ] Deduced a trap composed of 204 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:33:46] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:33:46] [INFO ] Deduced a trap composed of 189 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:33:46] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:33:47] [INFO ] Deduced a trap composed of 210 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:33:47] [INFO ] Deduced a trap composed of 194 places in 190 ms of which 2 ms to minimize.
[2024-05-28 14:33:47] [INFO ] Deduced a trap composed of 188 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:33:47] [INFO ] Deduced a trap composed of 200 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:33:48] [INFO ] Deduced a trap composed of 200 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:33:48] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:33:48] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-05-28 14:33:49] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:33:49] [INFO ] Deduced a trap composed of 188 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:33:49] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:33:50] [INFO ] Deduced a trap composed of 191 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:33:50] [INFO ] Deduced a trap composed of 183 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:33:50] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:33:50] [INFO ] Deduced a trap composed of 184 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:33:50] [INFO ] Deduced a trap composed of 200 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:33:51] [INFO ] Deduced a trap composed of 199 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:33:51] [INFO ] Deduced a trap composed of 187 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:33:51] [INFO ] Deduced a trap composed of 169 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:33:51] [INFO ] Deduced a trap composed of 189 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:33:51] [INFO ] Deduced a trap composed of 216 places in 188 ms of which 2 ms to minimize.
[2024-05-28 14:33:52] [INFO ] Deduced a trap composed of 202 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:33:52] [INFO ] Deduced a trap composed of 198 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:33:52] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:33:52] [INFO ] Deduced a trap composed of 184 places in 203 ms of which 6 ms to minimize.
[2024-05-28 14:33:52] [INFO ] Deduced a trap composed of 192 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:33:53] [INFO ] Deduced a trap composed of 191 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 976 unsolved
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 180 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 194 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 187 places in 281 ms of which 3 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 207 places in 264 ms of which 3 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 217 places in 277 ms of which 3 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 219 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:34:03] [INFO ] Deduced a trap composed of 209 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:34:03] [INFO ] Deduced a trap composed of 212 places in 216 ms of which 4 ms to minimize.
[2024-05-28 14:34:03] [INFO ] Deduced a trap composed of 216 places in 197 ms of which 4 ms to minimize.
[2024-05-28 14:34:03] [INFO ] Deduced a trap composed of 204 places in 250 ms of which 4 ms to minimize.
[2024-05-28 14:34:04] [INFO ] Deduced a trap composed of 206 places in 234 ms of which 4 ms to minimize.
[2024-05-28 14:34:04] [INFO ] Deduced a trap composed of 208 places in 210 ms of which 4 ms to minimize.
[2024-05-28 14:34:04] [INFO ] Deduced a trap composed of 211 places in 231 ms of which 4 ms to minimize.
[2024-05-28 14:34:04] [INFO ] Deduced a trap composed of 233 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:34:05] [INFO ] Deduced a trap composed of 206 places in 199 ms of which 3 ms to minimize.
[2024-05-28 14:34:05] [INFO ] Deduced a trap composed of 209 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:34:05] [INFO ] Deduced a trap composed of 204 places in 206 ms of which 3 ms to minimize.
SMT process timed out in 31434ms, After SMT, problems are : Problem set: 0 solved, 976 unsolved
Search for dead transitions found 0 dead transitions in 31459ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80760 ms. Remains : 454/454 places, 978/978 transitions.
Built C files in :
/tmp/ltsmin17835872685327060896
[2024-05-28 14:34:05] [INFO ] Computing symmetric may disable matrix : 978 transitions.
[2024-05-28 14:34:05] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:34:05] [INFO ] Computing symmetric may enable matrix : 978 transitions.
[2024-05-28 14:34:05] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:34:05] [INFO ] Computing Do-Not-Accords matrix : 978 transitions.
[2024-05-28 14:34:05] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:34:05] [INFO ] Built C files in 220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17835872685327060896
Running compilation step : cd /tmp/ltsmin17835872685327060896;'/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/ltsmin17835872685327060896;'/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/ltsmin17835872685327060896;'/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 14:34:08] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:34:09] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:34:09] [INFO ] Time to serialize gal into /tmp/LTL1996979409847657099.gal : 14 ms
[2024-05-28 14:34:09] [INFO ] Time to serialize properties into /tmp/LTL17301922951474351428.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/LTL1996979409847657099.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11261538845440483319.hoa' '-atoms' '/tmp/LTL17301922951474351428.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...319
Loading property file /tmp/LTL17301922951474351428.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11261538845440483319.hoa
Detected timeout of ITS tools.
[2024-05-28 14:34:24] [INFO ] Flatten gal took : 68 ms
[2024-05-28 14:34:24] [INFO ] Flatten gal took : 59 ms
[2024-05-28 14:34:24] [INFO ] Time to serialize gal into /tmp/LTL9572480029079702061.gal : 10 ms
[2024-05-28 14:34:24] [INFO ] Time to serialize properties into /tmp/LTL1550737115997614171.ltl : 14 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/LTL9572480029079702061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1550737115997614171.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("((((P_1155_0+P_1155_1)+(P_1155_2+P_1155_3))+((P_1155_4+P_1155_5)+(P_1155_6+P_1155_7)))>P_1093)"))))
Formula 0 simplified : FG!"((((P_1155_0+P_1155_1)+(P_1155_2+P_1155_3))+((P_1155_4+P_1155_5)+(P_1155_6+P_1155_7)))>P_1093)"
Detected timeout of ITS tools.
[2024-05-28 14:34:39] [INFO ] Flatten gal took : 71 ms
[2024-05-28 14:34:39] [INFO ] Applying decomposition
[2024-05-28 14:34:39] [INFO ] Flatten gal took : 55 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/graph12973648853744039813.txt' '-o' '/tmp/graph12973648853744039813.bin' '-w' '/tmp/graph12973648853744039813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12973648853744039813.bin' '-l' '-1' '-v' '-w' '/tmp/graph12973648853744039813.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:34:39] [INFO ] Decomposing Gal with order
[2024-05-28 14:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:34:40] [INFO ] Removed a total of 927 redundant transitions.
[2024-05-28 14:34:40] [INFO ] Flatten gal took : 338 ms
[2024-05-28 14:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 43 ms.
[2024-05-28 14:34:40] [INFO ] Time to serialize gal into /tmp/LTL5232247374397060412.gal : 10 ms
[2024-05-28 14:34:40] [INFO ] Time to serialize properties into /tmp/LTL12606296143147724609.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/LTL5232247374397060412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12606296143147724609.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("((((gu35.P_1155_0+gu35.P_1155_1)+(gu35.P_1155_2+gu35.P_1155_3))+((gu35.P_1155_4+gu35.P_1155_5)+(gu35.P_1155_6+gu35.P_1155_7)))...173
Formula 0 simplified : FG!"((((gu35.P_1155_0+gu35.P_1155_1)+(gu35.P_1155_2+gu35.P_1155_3))+((gu35.P_1155_4+gu35.P_1155_5)+(gu35.P_1155_6+gu35.P_1155_7)))>g...167
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-00 finished in 374296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 47 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 672 transition count 1250
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 624 transition count 1242
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 616 transition count 1242
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 112 place count 616 transition count 1170
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 256 place count 544 transition count 1170
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 368 place count 488 transition count 1114
Applied a total of 368 rules in 93 ms. Remains 488 /672 variables (removed 184) and now considering 1114/1298 (removed 184) transitions.
Running 1112 sub problems to find dead transitions.
[2024-05-28 14:34:55] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 488 cols
[2024-05-28 14:34:55] [INFO ] Computed 44 invariants in 12 ms
[2024-05-28 14:34:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 5 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:35:05] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-28 14:35:06] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:35:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:35:06] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:35:06] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 0 ms to minimize.
[2024-05-28 14:35:06] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:35:06] [INFO ] Deduced a trap composed of 189 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:35:07] [INFO ] Deduced a trap composed of 191 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:35:08] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-28 14:35:13] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:35:14] [INFO ] Deduced a trap composed of 95 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1586 variables, and 57 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:35:21] [INFO ] Deduced a trap composed of 75 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:35:23] [INFO ] Deduced a trap composed of 190 places in 267 ms of which 3 ms to minimize.
[2024-05-28 14:35:24] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:35:29] [INFO ] Deduced a trap composed of 227 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 174 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1586 variables, and 62 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 20/20 constraints]
After SMT, in 41881ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41892ms
[2024-05-28 14:35:37] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 14:35:37] [INFO ] Invariant cache hit.
[2024-05-28 14:35:37] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-28 14:35:37] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 14:35:37] [INFO ] Invariant cache hit.
[2024-05-28 14:35:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:35:44] [INFO ] Implicit Places using invariants and state equation in 6589 ms returned []
Implicit Place search using SMT with State Equation took 7047 ms to find 0 implicit places.
[2024-05-28 14:35:44] [INFO ] Redundant transitions in 18 ms returned []
Running 1112 sub problems to find dead transitions.
[2024-05-28 14:35:44] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 14:35:44] [INFO ] Invariant cache hit.
[2024-05-28 14:35:44] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:35:53] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 3 ms to minimize.
[2024-05-28 14:35:53] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:35:54] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:35:54] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:35:54] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:35:54] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:35:54] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:35:54] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:35:55] [INFO ] Deduced a trap composed of 189 places in 304 ms of which 4 ms to minimize.
[2024-05-28 14:35:55] [INFO ] Deduced a trap composed of 185 places in 473 ms of which 6 ms to minimize.
[2024-05-28 14:36:06] [INFO ] Deduced a trap composed of 176 places in 263 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1586 variables, and 53 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-05-28 14:36:17] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:36:25] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
[2024-05-28 14:36:26] [INFO ] Deduced a trap composed of 199 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:36:26] [INFO ] Deduced a trap composed of 93 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:36:27] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:36:31] [INFO ] Deduced a trap composed of 174 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1586 variables, and 59 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/488 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 17/17 constraints]
After SMT, in 61665ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 61687ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/672 places, 1114/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110764 ms. Remains : 488/672 places, 1114/1298 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-01
Product exploration explored 100000 steps with 28 reset in 559 ms.
Stack based approach found an accepted trace after 1178 steps with 1 reset with depth 965 and stack size 965 in 7 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-01 finished in 111466 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&&X(G(p1)))))'
Support contains 11 out of 672 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 672 transition count 1250
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 624 transition count 1250
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 624 transition count 1170
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 256 place count 544 transition count 1170
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 384 place count 480 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 472 transition count 1098
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 472 transition count 1098
Applied a total of 400 rules in 75 ms. Remains 472 /672 variables (removed 200) and now considering 1098/1298 (removed 200) transitions.
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:36:47] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 472 cols
[2024-05-28 14:36:47] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 14:36:47] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:36:56] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:36:57] [INFO ] Deduced a trap composed of 190 places in 280 ms of which 3 ms to minimize.
[2024-05-28 14:36:58] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:36:58] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1554 variables, and 52 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:37:11] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:37:11] [INFO ] Deduced a trap composed of 205 places in 277 ms of which 4 ms to minimize.
[2024-05-28 14:37:11] [INFO ] Deduced a trap composed of 181 places in 320 ms of which 4 ms to minimize.
[2024-05-28 14:37:16] [INFO ] Deduced a trap composed of 292 places in 315 ms of which 6 ms to minimize.
[2024-05-28 14:37:25] [INFO ] Deduced a trap composed of 164 places in 274 ms of which 4 ms to minimize.
[2024-05-28 14:37:26] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1554 variables, and 58 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 16/16 constraints]
After SMT, in 42247ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 42261ms
[2024-05-28 14:37:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:37:29] [INFO ] Invariant cache hit.
[2024-05-28 14:37:29] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 14:37:29] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:37:29] [INFO ] Invariant cache hit.
[2024-05-28 14:37:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:37:34] [INFO ] Implicit Places using invariants and state equation in 4538 ms returned []
Implicit Place search using SMT with State Equation took 4985 ms to find 0 implicit places.
[2024-05-28 14:37:34] [INFO ] Redundant transitions in 14 ms returned []
Running 1096 sub problems to find dead transitions.
[2024-05-28 14:37:34] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2024-05-28 14:37:34] [INFO ] Invariant cache hit.
[2024-05-28 14:37:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:37:44] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:37:44] [INFO ] Deduced a trap composed of 188 places in 321 ms of which 3 ms to minimize.
[2024-05-28 14:37:44] [INFO ] Deduced a trap composed of 187 places in 416 ms of which 6 ms to minimize.
[2024-05-28 14:37:45] [INFO ] Deduced a trap composed of 190 places in 294 ms of which 5 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:37:49] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:37:55] [INFO ] Deduced a trap composed of 173 places in 293 ms of which 4 ms to minimize.
[2024-05-28 14:37:56] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1554 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:38:09] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:38:11] [INFO ] Deduced a trap composed of 174 places in 247 ms of which 4 ms to minimize.
[2024-05-28 14:38:11] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:38:17] [INFO ] Deduced a trap composed of 292 places in 275 ms of which 3 ms to minimize.
[2024-05-28 14:38:18] [INFO ] Deduced a trap composed of 302 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-05-28 14:38:23] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:38:23] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:38:23] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1554 variables, and 65 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints]
After SMT, in 61866ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 61883ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/672 places, 1098/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109237 ms. Remains : 472/672 places, 1098/1298 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-06
Product exploration explored 100000 steps with 21 reset in 404 ms.
Stack based approach found an accepted trace after 560 steps with 0 reset with depth 561 and stack size 561 in 3 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-06 finished in 109739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U p2))))'
Support contains 14 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1290
Applied a total of 16 rules in 17 ms. Remains 664 /672 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:38:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-05-28 14:38:36] [INFO ] Computed 44 invariants in 16 ms
[2024-05-28 14:38:36] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:38:49] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 349 places in 310 ms of which 5 ms to minimize.
[2024-05-28 14:38:50] [INFO ] Deduced a trap composed of 372 places in 320 ms of which 4 ms to minimize.
[2024-05-28 14:38:51] [INFO ] Deduced a trap composed of 358 places in 329 ms of which 5 ms to minimize.
[2024-05-28 14:38:51] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:38:52] [INFO ] Deduced a trap composed of 368 places in 391 ms of which 5 ms to minimize.
[2024-05-28 14:38:53] [INFO ] Deduced a trap composed of 347 places in 310 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:39:00] [INFO ] Deduced a trap composed of 171 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:39:00] [INFO ] Deduced a trap composed of 396 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:39:01] [INFO ] Deduced a trap composed of 342 places in 355 ms of which 5 ms to minimize.
[2024-05-28 14:39:09] [INFO ] Deduced a trap composed of 408 places in 334 ms of which 5 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 349 places in 343 ms of which 4 ms to minimize.
[2024-05-28 14:39:15] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:39:16] [INFO ] Deduced a trap composed of 74 places in 366 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 63 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 21/21 constraints]
After SMT, in 41774ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41788ms
[2024-05-28 14:39:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:39:18] [INFO ] Invariant cache hit.
[2024-05-28 14:39:19] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-28 14:39:19] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:39:19] [INFO ] Invariant cache hit.
[2024-05-28 14:39:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:39:27] [INFO ] Implicit Places using invariants and state equation in 8073 ms returned []
Implicit Place search using SMT with State Equation took 8597 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:39:27] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:39:27] [INFO ] Invariant cache hit.
[2024-05-28 14:39:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:39:42] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:39:42] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:39:47] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:39:48] [INFO ] Deduced a trap composed of 350 places in 272 ms of which 8 ms to minimize.
[2024-05-28 14:39:49] [INFO ] Deduced a trap composed of 397 places in 334 ms of which 5 ms to minimize.
[2024-05-28 14:39:49] [INFO ] Deduced a trap composed of 46 places in 325 ms of which 5 ms to minimize.
[2024-05-28 14:39:49] [INFO ] Deduced a trap composed of 346 places in 270 ms of which 3 ms to minimize.
[2024-05-28 14:39:50] [INFO ] Deduced a trap composed of 348 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 54 places in 347 ms of which 5 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 114 places in 328 ms of which 5 ms to minimize.
[2024-05-28 14:39:56] [INFO ] Deduced a trap composed of 165 places in 329 ms of which 5 ms to minimize.
[2024-05-28 14:39:58] [INFO ] Deduced a trap composed of 386 places in 326 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:40:00] [INFO ] Deduced a trap composed of 374 places in 329 ms of which 5 ms to minimize.
[2024-05-28 14:40:01] [INFO ] Deduced a trap composed of 386 places in 304 ms of which 4 ms to minimize.
[2024-05-28 14:40:01] [INFO ] Deduced a trap composed of 366 places in 265 ms of which 4 ms to minimize.
[2024-05-28 14:40:10] [INFO ] Deduced a trap composed of 360 places in 337 ms of which 5 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 392 places in 376 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 67 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 61824ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 61844ms
Starting structural reductions in LTL mode, iteration 1 : 664/672 places, 1290/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112254 ms. Remains : 664/672 places, 1290/1298 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-09 finished in 112437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 16 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1290
Applied a total of 16 rules in 24 ms. Remains 664 /672 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:40:29] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:40:29] [INFO ] Invariant cache hit.
[2024-05-28 14:40:29] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:40:45] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:40:45] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:40:47] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 50 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:40:52] [INFO ] Deduced a trap composed of 142 places in 324 ms of which 5 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 184 places in 286 ms of which 5 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 335 places in 336 ms of which 4 ms to minimize.
[2024-05-28 14:40:54] [INFO ] Deduced a trap composed of 386 places in 310 ms of which 5 ms to minimize.
[2024-05-28 14:40:58] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:41:03] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:41:07] [INFO ] Deduced a trap composed of 326 places in 334 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(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 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 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 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 9)
(s195 0)
(s196 1)
(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 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(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 0)
(s273 0)
(s274 0)
(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 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 6)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 4)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 1)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 1)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 57 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 15/15 constraints]
After SMT, in 41978ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41996ms
[2024-05-28 14:41:11] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:41:11] [INFO ] Invariant cache hit.
[2024-05-28 14:41:11] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-28 14:41:11] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:41:11] [INFO ] Invariant cache hit.
[2024-05-28 14:41:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:41:20] [INFO ] Implicit Places using invariants and state equation in 8545 ms returned []
Implicit Place search using SMT with State Equation took 9132 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:41:20] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:41:20] [INFO ] Invariant cache hit.
[2024-05-28 14:41:20] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:41:35] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:41:36] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:41:38] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:41:38] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:41:39] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:41:42] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 350 places in 371 ms of which 5 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 397 places in 345 ms of which 5 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 46 places in 337 ms of which 4 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 346 places in 349 ms of which 4 ms to minimize.
[2024-05-28 14:41:45] [INFO ] Deduced a trap composed of 348 places in 329 ms of which 5 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 4 ms to minimize.
[2024-05-28 14:41:51] [INFO ] Deduced a trap composed of 114 places in 321 ms of which 5 ms to minimize.
[2024-05-28 14:41:52] [INFO ] Deduced a trap composed of 165 places in 337 ms of which 4 ms to minimize.
SMT process timed out in 31960ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 31986ms
Starting structural reductions in LTL mode, iteration 1 : 664/672 places, 1290/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83148 ms. Remains : 664/672 places, 1290/1298 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-10 finished in 83299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1290
Applied a total of 16 rules in 70 ms. Remains 664 /672 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:41:52] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:41:52] [INFO ] Invariant cache hit.
[2024-05-28 14:41:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:42:08] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:42:08] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:42:11] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:42:13] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 51 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:42:16] [INFO ] Deduced a trap composed of 187 places in 239 ms of which 4 ms to minimize.
[2024-05-28 14:42:16] [INFO ] Deduced a trap composed of 322 places in 310 ms of which 5 ms to minimize.
[2024-05-28 14:42:17] [INFO ] Deduced a trap composed of 382 places in 336 ms of which 5 ms to minimize.
[2024-05-28 14:42:25] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:42:26] [INFO ] Deduced a trap composed of 355 places in 281 ms of which 4 ms to minimize.
[2024-05-28 14:42:26] [INFO ] Deduced a trap composed of 357 places in 297 ms of which 4 ms to minimize.
[2024-05-28 14:42:32] [INFO ] Deduced a trap composed of 330 places in 302 ms of which 3 ms to minimize.
[2024-05-28 14:42:34] [INFO ] Deduced a trap composed of 75 places in 459 ms of which 31 ms to minimize.
[2024-05-28 14:42:34] [INFO ] Deduced a trap composed of 350 places in 352 ms of which 5 ms to minimize.
SMT process timed out in 42169ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 42188ms
[2024-05-28 14:42:34] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:42:34] [INFO ] Invariant cache hit.
[2024-05-28 14:42:35] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-28 14:42:35] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:42:35] [INFO ] Invariant cache hit.
[2024-05-28 14:42:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:42:48] [INFO ] Implicit Places using invariants and state equation in 12828 ms returned []
Implicit Place search using SMT with State Equation took 13408 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:42:48] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:42:48] [INFO ] Invariant cache hit.
[2024-05-28 14:42:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 2 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:43:07] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 350 places in 380 ms of which 5 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 397 places in 347 ms of which 5 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 46 places in 317 ms of which 5 ms to minimize.
[2024-05-28 14:43:10] [INFO ] Deduced a trap composed of 346 places in 295 ms of which 3 ms to minimize.
[2024-05-28 14:43:10] [INFO ] Deduced a trap composed of 348 places in 294 ms of which 3 ms to minimize.
[2024-05-28 14:43:15] [INFO ] Deduced a trap composed of 54 places in 342 ms of which 5 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 114 places in 316 ms of which 4 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 165 places in 300 ms of which 5 ms to minimize.
[2024-05-28 14:43:18] [INFO ] Deduced a trap composed of 386 places in 420 ms of which 6 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 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:43:21] [INFO ] Deduced a trap composed of 374 places in 338 ms of which 5 ms to minimize.
[2024-05-28 14:43:22] [INFO ] Deduced a trap composed of 386 places in 305 ms of which 5 ms to minimize.
[2024-05-28 14:43:22] [INFO ] Deduced a trap composed of 366 places in 304 ms of which 3 ms to minimize.
[2024-05-28 14:43:31] [INFO ] Deduced a trap composed of 360 places in 298 ms of which 5 ms to minimize.
[2024-05-28 14:43:32] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:43:33] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:43:43] [INFO ] Deduced a trap composed of 392 places in 366 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 67 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 61763ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 61775ms
Starting structural reductions in LTL mode, iteration 1 : 664/672 places, 1290/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117449 ms. Remains : 664/672 places, 1290/1298 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 396 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 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-S02J06T08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-11 finished in 118361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 15 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1290
Applied a total of 16 rules in 24 ms. Remains 664 /672 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:43:50] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:43:50] [INFO ] Invariant cache hit.
[2024-05-28 14:43:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:44:04] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:44:05] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:44:10] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:44:12] [INFO ] Deduced a trap composed of 350 places in 353 ms of which 5 ms to minimize.
[2024-05-28 14:44:13] [INFO ] Deduced a trap composed of 397 places in 373 ms of which 5 ms to minimize.
SMT process timed out in 22229ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 22246ms
[2024-05-28 14:44:13] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:44:13] [INFO ] Invariant cache hit.
[2024-05-28 14:44:13] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-28 14:44:13] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:44:13] [INFO ] Invariant cache hit.
[2024-05-28 14:44:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:44:22] [INFO ] Implicit Places using invariants and state equation in 9120 ms returned []
Implicit Place search using SMT with State Equation took 9620 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:44:22] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:44:22] [INFO ] Invariant cache hit.
[2024-05-28 14:44:22] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:44:37] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:44:37] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:44:39] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:44:42] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 1 ms to minimize.
[2024-05-28 14:44:44] [INFO ] Deduced a trap composed of 350 places in 367 ms of which 5 ms to minimize.
[2024-05-28 14:44:45] [INFO ] Deduced a trap composed of 397 places in 377 ms of which 5 ms to minimize.
[2024-05-28 14:44:45] [INFO ] Deduced a trap composed of 46 places in 394 ms of which 4 ms to minimize.
[2024-05-28 14:44:46] [INFO ] Deduced a trap composed of 346 places in 433 ms of which 6 ms to minimize.
[2024-05-28 14:44:46] [INFO ] Deduced a trap composed of 348 places in 359 ms of which 5 ms to minimize.
[2024-05-28 14:44:51] [INFO ] Deduced a trap composed of 54 places in 434 ms of which 6 ms to minimize.
[2024-05-28 14:44:52] [INFO ] Deduced a trap composed of 114 places in 362 ms of which 5 ms to minimize.
[2024-05-28 14:44:52] [INFO ] Deduced a trap composed of 165 places in 325 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 59 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:44:56] [INFO ] Deduced a trap composed of 374 places in 318 ms of which 5 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 386 places in 351 ms of which 5 ms to minimize.
[2024-05-28 14:44:57] [INFO ] Deduced a trap composed of 366 places in 307 ms of which 5 ms to minimize.
[2024-05-28 14:44:58] [INFO ] Deduced a trap composed of 315 places in 310 ms of which 5 ms to minimize.
[2024-05-28 14:44:58] [INFO ] Deduced a trap composed of 389 places in 273 ms of which 5 ms to minimize.
[2024-05-28 14:45:07] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:45:08] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:45:11] [INFO ] Deduced a trap composed of 352 places in 347 ms of which 4 ms to minimize.
[2024-05-28 14:45:12] [INFO ] Deduced a trap composed of 345 places in 339 ms of which 5 ms to minimize.
[2024-05-28 14:45:12] [INFO ] Deduced a trap composed of 350 places in 264 ms of which 4 ms to minimize.
[2024-05-28 14:45:13] [INFO ] Deduced a trap composed of 341 places in 333 ms of which 3 ms to minimize.
[2024-05-28 14:45:13] [INFO ] Deduced a trap composed of 348 places in 227 ms of which 4 ms to minimize.
[2024-05-28 14:45:13] [INFO ] Deduced a trap composed of 327 places in 248 ms of which 3 ms to minimize.
[2024-05-28 14:45:13] [INFO ] Deduced a trap composed of 348 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 73 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 31/31 constraints]
After SMT, in 62098ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 62115ms
Starting structural reductions in LTL mode, iteration 1 : 664/672 places, 1290/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94014 ms. Remains : 664/672 places, 1290/1298 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-12 finished in 94132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 10 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1290
Applied a total of 16 rules in 23 ms. Remains 664 /672 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:45:25] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:45:25] [INFO ] Invariant cache hit.
[2024-05-28 14:45:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:45:42] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:45:43] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 50 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:45:48] [INFO ] Deduced a trap composed of 142 places in 369 ms of which 5 ms to minimize.
[2024-05-28 14:45:49] [INFO ] Deduced a trap composed of 184 places in 372 ms of which 5 ms to minimize.
[2024-05-28 14:45:50] [INFO ] Deduced a trap composed of 335 places in 457 ms of which 19 ms to minimize.
[2024-05-28 14:45:50] [INFO ] Deduced a trap composed of 386 places in 338 ms of which 5 ms to minimize.
[2024-05-28 14:45:54] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:45:59] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:46:03] [INFO ] Deduced a trap composed of 326 places in 327 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 57 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 15/15 constraints]
After SMT, in 41687ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41704ms
[2024-05-28 14:46:06] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:46:06] [INFO ] Invariant cache hit.
[2024-05-28 14:46:07] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-28 14:46:07] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:46:07] [INFO ] Invariant cache hit.
[2024-05-28 14:46:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:46:15] [INFO ] Implicit Places using invariants and state equation in 8423 ms returned []
Implicit Place search using SMT with State Equation took 8813 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:46:15] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:46:15] [INFO ] Invariant cache hit.
[2024-05-28 14:46:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:46:30] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:46:31] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:46:33] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:46:33] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:46:33] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:46:33] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:46:33] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:46:33] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:46:36] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-05-28 14:46:37] [INFO ] Deduced a trap composed of 350 places in 348 ms of which 5 ms to minimize.
[2024-05-28 14:46:38] [INFO ] Deduced a trap composed of 397 places in 315 ms of which 4 ms to minimize.
[2024-05-28 14:46:38] [INFO ] Deduced a trap composed of 46 places in 290 ms of which 4 ms to minimize.
[2024-05-28 14:46:38] [INFO ] Deduced a trap composed of 346 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:46:39] [INFO ] Deduced a trap composed of 348 places in 318 ms of which 5 ms to minimize.
[2024-05-28 14:46:43] [INFO ] Deduced a trap composed of 54 places in 343 ms of which 5 ms to minimize.
[2024-05-28 14:46:44] [INFO ] Deduced a trap composed of 114 places in 318 ms of which 5 ms to minimize.
[2024-05-28 14:46:45] [INFO ] Deduced a trap composed of 165 places in 291 ms of which 4 ms to minimize.
[2024-05-28 14:46:47] [INFO ] Deduced a trap composed of 386 places in 318 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 374 places in 326 ms of which 4 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 386 places in 306 ms of which 5 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 366 places in 311 ms of which 5 ms to minimize.
[2024-05-28 14:46:57] [INFO ] Deduced a trap composed of 360 places in 337 ms of which 5 ms to minimize.
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-28 14:46:59] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:47:11] [INFO ] Deduced a trap composed of 392 places in 340 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 67 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 61949ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 61966ms
Starting structural reductions in LTL mode, iteration 1 : 664/672 places, 1290/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112567 ms. Remains : 664/672 places, 1290/1298 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-13 finished in 112741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(p1)))'
Support contains 18 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Applied a total of 0 rules in 9 ms. Remains 672 /672 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
Running 1296 sub problems to find dead transitions.
[2024-05-28 14:47:17] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 672 cols
[2024-05-28 14:47:17] [INFO ] Computed 44 invariants in 28 ms
[2024-05-28 14:47:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:47:31] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:47:32] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:47:32] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:47:32] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:47:32] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:47:32] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:47:32] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:47:33] [INFO ] Deduced a trap composed of 373 places in 351 ms of which 5 ms to minimize.
[2024-05-28 14:47:33] [INFO ] Deduced a trap composed of 324 places in 302 ms of which 3 ms to minimize.
[2024-05-28 14:47:33] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:47:34] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:47:35] [INFO ] Deduced a trap composed of 368 places in 339 ms of which 4 ms to minimize.
[2024-05-28 14:47:35] [INFO ] Deduced a trap composed of 389 places in 310 ms of which 4 ms to minimize.
[2024-05-28 14:47:35] [INFO ] Deduced a trap composed of 382 places in 252 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1954 variables, and 56 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:47:41] [INFO ] Deduced a trap composed of 330 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:47:41] [INFO ] Deduced a trap composed of 393 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 375 places in 334 ms of which 5 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 351 places in 304 ms of which 5 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 69 places in 275 ms of which 4 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 74 places in 358 ms of which 6 ms to minimize.
[2024-05-28 14:47:56] [INFO ] Deduced a trap composed of 348 places in 327 ms of which 5 ms to minimize.
[2024-05-28 14:47:56] [INFO ] Deduced a trap composed of 344 places in 298 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(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 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 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 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1954 variables, and 64 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 22/22 constraints]
After SMT, in 41669ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 41685ms
[2024-05-28 14:47:59] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:47:59] [INFO ] Invariant cache hit.
[2024-05-28 14:47:59] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-28 14:47:59] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:47:59] [INFO ] Invariant cache hit.
[2024-05-28 14:48:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:48:10] [INFO ] Implicit Places using invariants and state equation in 10322 ms returned []
Implicit Place search using SMT with State Equation took 10748 ms to find 0 implicit places.
Running 1296 sub problems to find dead transitions.
[2024-05-28 14:48:10] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
[2024-05-28 14:48:10] [INFO ] Invariant cache hit.
[2024-05-28 14:48:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:48:22] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:48:23] [INFO ] Deduced a trap composed of 370 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:48:24] [INFO ] Deduced a trap composed of 179 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:48:24] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:48:25] [INFO ] Deduced a trap composed of 342 places in 373 ms of which 5 ms to minimize.
[2024-05-28 14:48:25] [INFO ] Deduced a trap composed of 395 places in 322 ms of which 5 ms to minimize.
[2024-05-28 14:48:26] [INFO ] Deduced a trap composed of 379 places in 378 ms of which 4 ms to minimize.
[2024-05-28 14:48:37] [INFO ] Deduced a trap composed of 352 places in 266 ms of which 5 ms to minimize.
[2024-05-28 14:48:37] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:48:40] [INFO ] Deduced a trap composed of 444 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:48:41] [INFO ] Deduced a trap composed of 399 places in 222 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/1954 variables, and 59 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1296/1296 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:48:55] [INFO ] Deduced a trap composed of 352 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:48:56] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:48:56] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 4 ms to minimize.
[2024-05-28 14:48:57] [INFO ] Deduced a trap composed of 75 places in 399 ms of which 5 ms to minimize.
[2024-05-28 14:48:58] [INFO ] Deduced a trap composed of 75 places in 381 ms of which 4 ms to minimize.
[2024-05-28 14:48:58] [INFO ] Deduced a trap composed of 350 places in 364 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1296 unsolved
[2024-05-28 14:49:10] [INFO ] Deduced a trap composed of 430 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:49:11] [INFO ] Deduced a trap composed of 345 places in 331 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/1954 variables, and 67 constraints, problems are : Problem set: 0 solved, 1296 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/672 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1296 constraints, Known Traps: 25/25 constraints]
After SMT, in 61746ms problems are : Problem set: 0 solved, 1296 unsolved
Search for dead transitions found 0 dead transitions in 61766ms
Finished structural reductions in LTL mode , in 1 iterations and 114218 ms. Remains : 672/672 places, 1298/1298 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-14 finished in 114475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(!p1))))'
Support contains 104 out of 672 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 672/672 places, 1298/1298 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 664 transition count 1290
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 664 transition count 1290
Applied a total of 16 rules in 10 ms. Remains 664 /672 variables (removed 8) and now considering 1290/1298 (removed 8) transitions.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:49:12] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2024-05-28 14:49:12] [INFO ] Computed 44 invariants in 14 ms
[2024-05-28 14:49:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:49:24] [INFO ] Deduced a trap composed of 349 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:49:25] [INFO ] Deduced a trap composed of 372 places in 228 ms of which 4 ms to minimize.
[2024-05-28 14:49:25] [INFO ] Deduced a trap composed of 358 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:49:25] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:49:26] [INFO ] Deduced a trap composed of 368 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:49:26] [INFO ] Deduced a trap composed of 347 places in 298 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 (/ 1.0 3.0))
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 2.0 3.0))
(s20 1.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 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 9.0)
(s195 1.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 (/ 1.0 3.0))
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 (/ 1.0 3.0))
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 (/ 1.0 3.0))
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 (/ 8.0 3.0))
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:49:35] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:49:35] [INFO ] Deduced a trap composed of 396 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:49:36] [INFO ] Deduced a trap composed of 342 places in 230 ms of which 4 ms to minimize.
[2024-05-28 14:49:44] [INFO ] Deduced a trap composed of 408 places in 344 ms of which 7 ms to minimize.
[2024-05-28 14:49:46] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:49:50] [INFO ] Deduced a trap composed of 349 places in 252 ms of which 4 ms to minimize.
[2024-05-28 14:49:50] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:49:52] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 63 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 21/21 constraints]
After SMT, in 41686ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41697ms
[2024-05-28 14:49:53] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:49:53] [INFO ] Invariant cache hit.
[2024-05-28 14:49:54] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-28 14:49:54] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:49:54] [INFO ] Invariant cache hit.
[2024-05-28 14:49:55] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:50:03] [INFO ] Implicit Places using invariants and state equation in 9595 ms returned []
Implicit Place search using SMT with State Equation took 10125 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2024-05-28 14:50:04] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2024-05-28 14:50:04] [INFO ] Invariant cache hit.
[2024-05-28 14:50:04] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 2 ms to minimize.
[2024-05-28 14:50:18] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:50:20] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:50:21] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:50:23] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:50:25] [INFO ] Deduced a trap composed of 350 places in 280 ms of which 4 ms to minimize.
[2024-05-28 14:50:25] [INFO ] Deduced a trap composed of 397 places in 273 ms of which 4 ms to minimize.
[2024-05-28 14:50:26] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 5 ms to minimize.
[2024-05-28 14:50:26] [INFO ] Deduced a trap composed of 346 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:50:26] [INFO ] Deduced a trap composed of 348 places in 316 ms of which 4 ms to minimize.
[2024-05-28 14:50:31] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 114 places in 323 ms of which 4 ms to minimize.
[2024-05-28 14:50:32] [INFO ] Deduced a trap composed of 165 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:50:34] [INFO ] Deduced a trap composed of 386 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 374 places in 324 ms of which 5 ms to minimize.
[2024-05-28 14:50:37] [INFO ] Deduced a trap composed of 386 places in 226 ms of which 3 ms to minimize.
[2024-05-28 14:50:38] [INFO ] Deduced a trap composed of 366 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:50:47] [INFO ] Deduced a trap composed of 360 places in 338 ms of which 5 ms to minimize.
[2024-05-28 14:50:48] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:50:49] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-28 14:50:59] [INFO ] Deduced a trap composed of 392 places in 320 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 67 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 25/25 constraints]
After SMT, in 61996ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 62012ms
Starting structural reductions in LTL mode, iteration 1 : 664/672 places, 1290/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113851 ms. Remains : 664/672 places, 1290/1298 transitions.
Stuttering acceptance computed with spot in 137 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLCardinality-15 finished in 114004 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 14:51:06] [INFO ] Flatten gal took : 96 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5998007477147211341
[2024-05-28 14:51:06] [INFO ] Computing symmetric may disable matrix : 1298 transitions.
[2024-05-28 14:51:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:06] [INFO ] Computing symmetric may enable matrix : 1298 transitions.
[2024-05-28 14:51:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:06] [INFO ] Applying decomposition
[2024-05-28 14:51:06] [INFO ] Flatten gal took : 72 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/graph13035964296828301244.txt' '-o' '/tmp/graph13035964296828301244.bin' '-w' '/tmp/graph13035964296828301244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13035964296828301244.bin' '-l' '-1' '-v' '-w' '/tmp/graph13035964296828301244.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:51:06] [INFO ] Decomposing Gal with order
[2024-05-28 14:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:51:06] [INFO ] Computing Do-Not-Accords matrix : 1298 transitions.
[2024-05-28 14:51:06] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:51:06] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5998007477147211341
Running compilation step : cd /tmp/ltsmin5998007477147211341;'/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 14:51:07] [INFO ] Removed a total of 1221 redundant transitions.
[2024-05-28 14:51:07] [INFO ] Flatten gal took : 280 ms
[2024-05-28 14:51:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 79 ms.
[2024-05-28 14:51:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality16055686991761431849.gal : 9 ms
[2024-05-28 14:51:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality16663531644155461537.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/LTLCardinality16055686991761431849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16663531644155461537.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("((((gu95.P_1155_0+gu95.P_1155_1)+(gu95.P_1155_2+gu95.P_1155_3))+((gu95.P_1155_4+gu95.P_1155_5)+(gu95.P_1155_6+gu95.P_1155_7)))...173
Formula 0 simplified : FG!"((((gu95.P_1155_0+gu95.P_1155_1)+(gu95.P_1155_2+gu95.P_1155_3))+((gu95.P_1155_4+gu95.P_1155_5)+(gu95.P_1155_6+gu95.P_1155_7)))>g...167
Compilation finished in 4503 ms.
Running link step : cd /tmp/ltsmin5998007477147211341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin5998007477147211341;'/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'
Detected timeout of ITS tools.
[2024-05-28 15:18:45] [INFO ] Applying decomposition
[2024-05-28 15:18:45] [INFO ] Flatten gal took : 114 ms
[2024-05-28 15:18:45] [INFO ] Decomposing Gal with order
[2024-05-28 15:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:18:45] [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],[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],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, P_1617_7, ScheduleTaskE_Idle_7],[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],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[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],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[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],

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 15:18:45] [INFO ] Flatten gal took : 147 ms
[2024-05-28 15:18:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality14093688481381233389.gal : 25 ms
[2024-05-28 15:18:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality12516544002068688627.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/LTLCardinality14093688481381233389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12516544002068688627.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("((((P_1155_0+P_1155_1)+(P_1155_2+P_1155_3))+((P_1155_4+P_1155_5)+(P_1155_6+P_1155_7)))>P_1093)"))))
Formula 0 simplified : FG!"((((P_1155_0+P_1155_1)+(P_1155_2+P_1155_3))+((P_1155_4+P_1155_5)+(P_1155_6+P_1155_7)))>P_1093)"

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

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