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.r516-tajo-171654446500171.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 ltsminxred
Input is PolyORBLF-COL-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 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.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717250871621

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:07:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:07:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:07:53] [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-06-01 14:07:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:07:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 615 ms
[2024-06-01 14:07:53] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:07:53] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 14:07:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40008 steps (3894 resets) in 1678 ms. (23 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40002 steps (144 resets) in 839 ms. (47 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40000 steps (266 resets) in 280 ms. (142 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2104 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (108 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (141 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
[2024-06-01 14:07:54] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:07:54] [INFO ] Computed 26 invariants in 10 ms
[2024-06-01 14:07:54] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/52 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 7 (OVERLAPS) 21/81 variables, 15/26 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 4 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/49 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/56 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/57 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 24/81 variables, 15/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 14:07:55] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 9 ms to minimize.
[2024-06-01 14:07:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
[2024-06-01 14:07:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 81/145 variables, and 29 constraints, problems are : Problem set: 6 solved, 0 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 516ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:07:55] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:07:55] [INFO ] Flatten gal took : 7 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-06-01 14:07:55] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 121 ms.
[2024-06-01 14:07:55] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 118 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Applied a total of 6 rules in 59 ms. Remains 448 /454 variables (removed 6) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-06-01 14:07:55] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 448 cols
[2024-06-01 14:07:55] [INFO ] Computed 44 invariants in 70 ms
[2024-06-01 14:07:55] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:08:21] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:08:22] [INFO ] Deduced a trap composed of 262 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 101 places in 309 ms of which 3 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 112 places in 341 ms of which 2 ms to minimize.
[2024-06-01 14:08:23] [INFO ] Deduced a trap composed of 131 places in 341 ms of which 3 ms to minimize.
[2024-06-01 14:08:24] [INFO ] Deduced a trap composed of 91 places in 378 ms of which 3 ms to minimize.
[2024-06-01 14:08:24] [INFO ] Deduced a trap composed of 129 places in 362 ms of which 3 ms to minimize.
[2024-06-01 14:08:24] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:08:25] [INFO ] Deduced a trap composed of 213 places in 393 ms of which 3 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 225 places in 400 ms of which 4 ms to minimize.
[2024-06-01 14:08:26] [INFO ] Deduced a trap composed of 238 places in 349 ms of which 2 ms to minimize.
[2024-06-01 14:08:27] [INFO ] Deduced a trap composed of 247 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:08:28] [INFO ] Deduced a trap composed of 231 places in 478 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 53 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-06-01 14:08:37] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 54 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 16/16 constraints]
After SMT, in 55244ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 55271ms
[2024-06-01 14:08:51] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 14:08:51] [INFO ] Invariant cache hit.
[2024-06-01 14:08:51] [INFO ] Implicit Places using invariants in 422 ms returned [354, 355, 356, 357]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 439 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/454 places, 1614/1614 transitions.
Applied a total of 0 rules in 25 ms. Remains 444 /444 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55816 ms. Remains : 444/454 places, 1614/1614 transitions.
Support contains 118 out of 444 places after structural reductions.
[2024-06-01 14:08:51] [INFO ] Flatten gal took : 217 ms
[2024-06-01 14:08:51] [INFO ] Flatten gal took : 158 ms
[2024-06-01 14:08:52] [INFO ] Input system was already deterministic with 1614 transitions.
RANDOM walk for 40000 steps (210 resets) in 821 ms. (48 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (61 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (103 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
[2024-06-01 14:08:52] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 444 cols
[2024-06-01 14:08:52] [INFO ] Computed 40 invariants in 45 ms
[2024-06-01 14:08:52] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/150 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/263 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/268 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 7 (OVERLAPS) 171/439 variables, 23/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/440 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/442 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1590/2032 variables, 442/481 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2032 variables, 112/593 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2032 variables, 0/593 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2034 variables, 2/595 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2034 variables, 1/596 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2034 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2034 variables, 0/596 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2034/2034 variables, and 596 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 444/444 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/146 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/259 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/264 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 175/439 variables, 23/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 122 places in 427 ms of which 4 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 3/39 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/39 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/40 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/442 variables, 2/42 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1590/2032 variables, 442/484 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2032 variables, 112/596 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2032 variables, 1/597 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2032 variables, 0/597 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/2034 variables, 2/599 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2034 variables, 1/600 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2034 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2034 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2034/2034 variables, and 600 constraints, problems are : Problem set: 3 solved, 1 unsolved in 2989 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 444/444 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 4152ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 13 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 444 transition count 1594
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 424 transition count 1590
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 420 transition count 1590
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 48 place count 420 transition count 1546
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 136 place count 376 transition count 1546
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 224 place count 332 transition count 1502
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 332 transition count 1494
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 240 place count 324 transition count 1494
Applied a total of 240 rules in 286 ms. Remains 324 /444 variables (removed 120) and now considering 1494/1614 (removed 120) transitions.
Running 1488 sub problems to find dead transitions.
[2024-06-01 14:08:57] [INFO ] Flow matrix only has 1470 transitions (discarded 24 similar events)
// Phase 1: matrix 1470 rows 324 cols
[2024-06-01 14:08:57] [INFO ] Computed 40 invariants in 51 ms
[2024-06-01 14:08:57] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 1488 unsolved
[2024-06-01 14:09:24] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 144 places in 367 ms of which 3 ms to minimize.
[2024-06-01 14:09:25] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 131 places in 427 ms of which 3 ms to minimize.
[2024-06-01 14:09:26] [INFO ] Deduced a trap composed of 150 places in 518 ms of which 2 ms to minimize.
[2024-06-01 14:09:27] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 2 ms to minimize.
[2024-06-01 14:09:30] [INFO ] Deduced a trap composed of 131 places in 363 ms of which 3 ms to minimize.
[2024-06-01 14:09:30] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:09:31] [INFO ] Deduced a trap composed of 125 places in 314 ms of which 2 ms to minimize.
[2024-06-01 14:09:34] [INFO ] Deduced a trap composed of 130 places in 411 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/1794 variables, and 46 constraints, problems are : Problem set: 0 solved, 1488 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1488/1488 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 1488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1488 unsolved
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 104 places in 368 ms of which 5 ms to minimize.
[2024-06-01 14:09:42] [INFO ] Deduced a trap composed of 163 places in 360 ms of which 3 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 162 places in 272 ms of which 2 ms to minimize.
[2024-06-01 14:09:43] [INFO ] Deduced a trap composed of 103 places in 348 ms of which 3 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 143 places in 292 ms of which 3 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 125 places in 268 ms of which 2 ms to minimize.
[2024-06-01 14:09:44] [INFO ] Deduced a trap composed of 118 places in 314 ms of which 3 ms to minimize.
[2024-06-01 14:09:48] [INFO ] Deduced a trap composed of 102 places in 318 ms of which 2 ms to minimize.
[2024-06-01 14:09:49] [INFO ] Deduced a trap composed of 52 places in 352 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/1794 variables, and 56 constraints, problems are : Problem set: 0 solved, 1488 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/324 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1488 constraints, Known Traps: 22/22 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 1488 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60485 ms. Remains : 324/444 places, 1494/1614 transitions.
RANDOM walk for 33656 steps (252 resets) in 424 ms. (79 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 444 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 408 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 408 transition count 1530
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 360 transition count 1530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 356 transition count 1526
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 356 transition count 1526
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 272 place count 308 transition count 1478
Applied a total of 272 rules in 125 ms. Remains 308 /444 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-06-01 14:09:58] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 308 cols
[2024-06-01 14:09:58] [INFO ] Computed 40 invariants in 34 ms
[2024-06-01 14:09:58] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:10:23] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:10:23] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:10:23] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:10:23] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:10:24] [INFO ] Deduced a trap composed of 134 places in 325 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 39 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:10:37] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 87 places in 320 ms of which 4 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 3 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 101 places in 343 ms of which 2 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 83 places in 338 ms of which 2 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 91 places in 316 ms of which 2 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 90 places in 297 ms of which 6 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 77 places in 277 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 47 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 13/13 constraints]
After SMT, in 58250ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 58270ms
[2024-06-01 14:10:56] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:10:56] [INFO ] Invariant cache hit.
[2024-06-01 14:10:56] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 14:10:56] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:10:56] [INFO ] Invariant cache hit.
[2024-06-01 14:10:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 14:11:00] [INFO ] Implicit Places using invariants and state equation in 3655 ms returned []
Implicit Place search using SMT with State Equation took 4079 ms to find 0 implicit places.
[2024-06-01 14:11:00] [INFO ] Redundant transitions in 112 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-06-01 14:11:00] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:11:00] [INFO ] Invariant cache hit.
[2024-06-01 14:11:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:11:26] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:11:26] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:11:26] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:11:26] [INFO ] Deduced a trap composed of 130 places in 389 ms of which 2 ms to minimize.
[2024-06-01 14:11:27] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 90 places in 319 ms of which 2 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 77 places in 321 ms of which 2 ms to minimize.
[2024-06-01 14:11:40] [INFO ] Deduced a trap composed of 122 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 133 places in 301 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 43 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:11:52] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 2 ms to minimize.
[2024-06-01 14:12:16] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 48 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 14/14 constraints]
After SMT, in 78852ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 78877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/444 places, 1478/1614 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141483 ms. Remains : 308/444 places, 1478/1614 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLCardinality-03
Stuttering criterion allowed to conclude after 2567 steps with 48 reset in 64 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLCardinality-03 finished in 141862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 5 out of 444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 444 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 408 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 408 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 360 transition count 1530
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 356 transition count 1526
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 356 transition count 1526
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 272 place count 308 transition count 1478
Applied a total of 272 rules in 90 ms. Remains 308 /444 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-06-01 14:12:19] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:12:19] [INFO ] Invariant cache hit.
[2024-06-01 14:12:19] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 130 places in 424 ms of which 3 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:12:57] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 3 ms to minimize.
[2024-06-01 14:12:57] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 3 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 122 places in 300 ms of which 3 ms to minimize.
SMT process timed out in 38383ms, After SMT, problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 38404ms
[2024-06-01 14:12:58] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:12:58] [INFO ] Invariant cache hit.
[2024-06-01 14:12:58] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-01 14:12:58] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:12:58] [INFO ] Invariant cache hit.
[2024-06-01 14:12:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 14:13:02] [INFO ] Implicit Places using invariants and state equation in 3657 ms returned []
Implicit Place search using SMT with State Equation took 4116 ms to find 0 implicit places.
[2024-06-01 14:13:02] [INFO ] Redundant transitions in 88 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-06-01 14:13:02] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-06-01 14:13:02] [INFO ] Invariant cache hit.
[2024-06-01 14:13:02] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 130 places in 431 ms of which 3 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 90 places in 292 ms of which 2 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 77 places in 282 ms of which 2 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 122 places in 294 ms of which 1 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 133 places in 309 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 9.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.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 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.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 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)timeout

(s223 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 43 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-06-01 14:14:08] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 2 ms to minimize.
[2024-06-01 14:14:08] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 2 ms to minimize.
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 2 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 48 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 14/14 constraints]
After SMT, in 78987ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 79008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/444 places, 1478/1614 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121727 ms. Remains : 308/444 places, 1478/1614 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLCardinality-06
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T04-LTLCardinality-06 finished in 121931 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)&&(G(p1)||X((p2||F(p3))))))'
Support contains 18 out of 444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 444/444 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 440 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 440 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 436 transition count 1606
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 436 transition count 1606
Applied a total of 16 rules in 44 ms. Remains 436 /444 variables (removed 8) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:14:21] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-06-01 14:14:21] [INFO ] Computed 40 invariants in 70 ms
[2024-06-01 14:14:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:14:50] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:14:50] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:14:50] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:14:50] [INFO ] Deduced a trap composed of 233 places in 317 ms of which 3 ms to minimize.
[2024-06-01 14:14:51] [INFO ] Deduced a trap composed of 230 places in 307 ms of which 2 ms to minimize.
[2024-06-01 14:14:51] [INFO ] Deduced a trap composed of 107 places in 286 ms of which 3 ms to minimize.
[2024-06-01 14:14:51] [INFO ] Deduced a trap composed of 127 places in 308 ms of which 2 ms to minimize.
[2024-06-01 14:14:52] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:14:52] [INFO ] Deduced a trap composed of 192 places in 329 ms of which 3 ms to minimize.
[2024-06-01 14:14:53] [INFO ] Deduced a trap composed of 235 places in 335 ms of which 3 ms to minimize.
[2024-06-01 14:14:54] [INFO ] Deduced a trap composed of 285 places in 413 ms of which 4 ms to minimize.
[2024-06-01 14:14:54] [INFO ] Deduced a trap composed of 269 places in 392 ms of which 2 ms to minimize.
[2024-06-01 14:14:55] [INFO ] Deduced a trap composed of 271 places in 344 ms of which 2 ms to minimize.
[2024-06-01 14:14:55] [INFO ] Deduced a trap composed of 286 places in 426 ms of which 3 ms to minimize.
[2024-06-01 14:14:56] [INFO ] Deduced a trap composed of 294 places in 446 ms of which 3 ms to minimize.
[2024-06-01 14:14:56] [INFO ] Deduced a trap composed of 248 places in 419 ms of which 3 ms to minimize.
[2024-06-01 14:14:56] [INFO ] Deduced a trap composed of 244 places in 383 ms of which 3 ms to minimize.
(s96 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.0)
(s7 0.0)
(s8 1.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 9.0)
(s83 1.0)
(s84 0.0)
(s85 1.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.0timeout
)
(s97 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 51 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 69 places in 368 ms of which 2 ms to minimize.
[2024-06-01 14:15:06] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 2 ms to minimize.
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 219 places in 428 ms of which 3 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 218 places in 412 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 24/24 constraints]
After SMT, in 58754ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 58779ms
[2024-06-01 14:15:20] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:15:20] [INFO ] Invariant cache hit.
[2024-06-01 14:15:21] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 14:15:21] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:15:21] [INFO ] Invariant cache hit.
[2024-06-01 14:15:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 14:15:27] [INFO ] Implicit Places using invariants and state equation in 6021 ms returned []
Implicit Place search using SMT with State Equation took 6426 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:15:27] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:15:27] [INFO ] Invariant cache hit.
[2024-06-01 14:15:27] [INFO ] State equation strengthened by 112 read => feed constraints.
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-00
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-01
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-02
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-03
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-04
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-05
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-06
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-07
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-08
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-09
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-10
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-11
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-12
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-13
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-14
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLCardinality-15

BK_STOP 1717251344688

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-00
ltl formula formula --ltl=/tmp/1013/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-01
ltl formula formula --ltl=/tmp/1013/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-02
ltl formula formula --ltl=/tmp/1013/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-03
ltl formula formula --ltl=/tmp/1013/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-04
ltl formula formula --ltl=/tmp/1013/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-05
ltl formula formula --ltl=/tmp/1013/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-06
ltl formula formula --ltl=/tmp/1013/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-07
ltl formula formula --ltl=/tmp/1013/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-08
ltl formula formula --ltl=/tmp/1013/ltl_8_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-09
ltl formula formula --ltl=/tmp/1013/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-10
ltl formula formula --ltl=/tmp/1013/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-11
ltl formula formula --ltl=/tmp/1013/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-12
ltl formula formula --ltl=/tmp/1013/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-13
ltl formula formula --ltl=/tmp/1013/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-14
ltl formula formula --ltl=/tmp/1013/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLCardinality-15
ltl formula formula --ltl=/tmp/1013/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported

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-S06J04T04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-COL-S06J04T04, 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 r516-tajo-171654446500171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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