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-171654446500179.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717251032967

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-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:10:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:10:34] [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:10:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:10:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 641 ms
[2024-06-01 14:10:35] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:10:35] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 14:10:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (3800 resets) in 2040 ms. (19 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40003 steps (125 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (156 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (190 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (151 resets) in 226 ms. (176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (118 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (118 resets) in 141 ms. (281 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (137 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (87 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
[2024-06-01 14:10:36] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:10:36] [INFO ] Computed 26 invariants in 17 ms
[2024-06-01 14:10:36] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/51 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/77 variables, 14/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 7 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/28 variables, 1/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/35 variables, 4/6 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/45 variables, 2/8 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/49 variables, 1/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-06-01 14:10:37] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 8 ms to minimize.
[2024-06-01 14:10:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 23 constraints, problems are : Problem set: 8 solved, 0 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 559ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:10:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 14:10:37] [INFO ] Flatten gal took : 26 ms
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:10:37] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-06-01 14:10:37] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 173 ms.
[2024-06-01 14:10:37] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 158 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Applied a total of 18 rules in 111 ms. Remains 620 /632 variables (removed 12) and now considering 2424/2430 (removed 6) transitions.
Running 2418 sub problems to find dead transitions.
[2024-06-01 14:10:37] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 620 cols
[2024-06-01 14:10:37] [INFO ] Computed 48 invariants in 119 ms
[2024-06-01 14:10:37] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
SMT process timed out in 39473ms, After SMT, problems are : Problem set: 0 solved, 2418 unsolved
Search for dead transitions found 0 dead transitions in 39514ms
[2024-06-01 14:11:17] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-06-01 14:11:17] [INFO ] Invariant cache hit.
[2024-06-01 14:11:17] [INFO ] Implicit Places using invariants in 551 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 575 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 614/632 places, 2424/2430 transitions.
Applied a total of 0 rules in 39 ms. Remains 614 /614 variables (removed 0) and now considering 2424/2424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40268 ms. Remains : 614/632 places, 2424/2430 transitions.
Support contains 158 out of 614 places after structural reductions.
[2024-06-01 14:11:18] [INFO ] Flatten gal took : 297 ms
[2024-06-01 14:11:18] [INFO ] Flatten gal took : 206 ms
[2024-06-01 14:11:18] [INFO ] Input system was already deterministic with 2424 transitions.
RANDOM walk for 40000 steps (244 resets) in 884 ms. (45 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40003 steps (88 resets) in 249 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (119 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (134 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (93 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 112 ms. (354 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (105 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (84 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
[2024-06-01 14:11:19] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 614 cols
[2024-06-01 14:11:19] [INFO ] Computed 42 invariants in 62 ms
[2024-06-01 14:11:19] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 163/213 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/218 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 6 (OVERLAPS) 387/605 variables, 21/35 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 2/37 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/606 variables, 1/38 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 11 (OVERLAPS) 6/612 variables, 5/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3000/3002 variables, and 655 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 612/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 486/499 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/549 variables, 12/21 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/611 variables, 19/40 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 2/42 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 85 places in 445 ms of which 4 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 85 places in 492 ms of which 4 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 153 places in 517 ms of which 4 ms to minimize.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 611/3002 variables, and 45 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 3151ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 6 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 60 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:11:23] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 14:11:23] [INFO ] Computed 42 invariants in 67 ms
[2024-06-01 14:11:23] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 44314ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 44352ms
[2024-06-01 14:12:07] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:12:07] [INFO ] Invariant cache hit.
[2024-06-01 14:12:08] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-01 14:12:08] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:12:08] [INFO ] Invariant cache hit.
[2024-06-01 14:12:08] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:12:20] [INFO ] Implicit Places using invariants and state equation in 11940 ms returned []
Implicit Place search using SMT with State Equation took 12547 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:12:20] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:12:20] [INFO ] Invariant cache hit.
[2024-06-01 14:12:20] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 411 places in 399 ms of which 3 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 367 places in 397 ms of which 4 ms to minimize.
[2024-06-01 14:13:08] [INFO ] Deduced a trap composed of 356 places in 376 ms of which 4 ms to minimize.
[2024-06-01 14:13:08] [INFO ] Deduced a trap composed of 137 places in 443 ms of which 4 ms to minimize.
[2024-06-01 14:13:09] [INFO ] Deduced a trap composed of 176 places in 414 ms of which 5 ms to minimize.
[2024-06-01 14:13:10] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:13:10] [INFO ] Deduced a trap composed of 314 places in 485 ms of which 4 ms to minimize.
[2024-06-01 14:13:11] [INFO ] Deduced a trap composed of 338 places in 479 ms of which 4 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 388 places in 588 ms of which 6 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 350 places in 576 ms of which 4 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 384 places in 566 ms of which 5 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 385 places in 571 ms of which 5 ms to minimize.
SMT process timed out in 55874ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 55930ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112913 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 164 ms :[p0, p0]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1100 ms.
Product exploration explored 100000 steps with 50000 reset in 1083 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-01 finished in 115380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 614 transition count 2388
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 578 transition count 2382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 572 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 84 place count 572 transition count 2310
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 228 place count 500 transition count 2310
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 372 place count 428 transition count 2238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 378 place count 422 transition count 2232
Iterating global reduction 3 with 6 rules applied. Total rules applied 384 place count 422 transition count 2232
Applied a total of 384 rules in 319 ms. Remains 422 /614 variables (removed 192) and now considering 2232/2424 (removed 192) transitions.
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:13:18] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2024-06-01 14:13:18] [INFO ] Computed 42 invariants in 53 ms
[2024-06-01 14:13:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 53 places in 338 ms of which 2 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 79 places in 302 ms of which 3 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 2 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 189 places in 453 ms of which 3 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 202 places in 436 ms of which 3 ms to minimize.
[2024-06-01 14:13:57] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 2 ms to minimize.
[2024-06-01 14:13:58] [INFO ] Deduced a trap composed of 184 places in 289 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:14:03] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 48 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 12/12 constraints]
After SMT, in 62788ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 62822ms
[2024-06-01 14:14:21] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:14:21] [INFO ] Invariant cache hit.
[2024-06-01 14:14:22] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-06-01 14:14:22] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:14:22] [INFO ] Invariant cache hit.
[2024-06-01 14:14:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:14:31] [INFO ] Implicit Places using invariants and state equation in 9547 ms returned []
Implicit Place search using SMT with State Equation took 10023 ms to find 0 implicit places.
[2024-06-01 14:14:31] [INFO ] Redundant transitions in 98 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:14:31] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:14:31] [INFO ] Invariant cache hit.
[2024-06-01 14:14:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:15:04] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:15:04] [INFO ] Deduced a trap composed of 223 places in 434 ms of which 3 ms to minimize.
[2024-06-01 14:15:05] [INFO ] Deduced a trap composed of 199 places in 375 ms of which 2 ms to minimize.
[2024-06-01 14:15:05] [INFO ] Deduced a trap composed of 190 places in 546 ms of which 3 ms to minimize.
[2024-06-01 14:15:06] [INFO ] Deduced a trap composed of 211 places in 456 ms of which 2 ms to minimize.
[2024-06-01 14:15:06] [INFO ] Deduced a trap composed of 189 places in 438 ms of which 2 ms to minimize.
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 206 places in 422 ms of which 3 ms to minimize.
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 15 places in 366 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:15:25] [INFO ] Deduced a trap composed of 65 places in 378 ms of which 2 ms to minimize.
[2024-06-01 14:15:48] [INFO ] Deduced a trap composed of 65 places in 342 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 51 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 15/15 constraints]
After SMT, in 79905ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 79927ms
Starting structural reductions in SI_LTL mode, iteration 1 : 422/614 places, 2232/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153207 ms. Remains : 422/614 places, 2232/2424 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-02
Product exploration explored 100000 steps with 1929 reset in 603 ms.
Product exploration explored 100000 steps with 1964 reset in 635 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 328 steps (3 resets) in 9 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:15:53] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:15:53] [INFO ] Invariant cache hit.
[2024-06-01 14:15:53] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:16:24] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:16:25] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:16:25] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:16:25] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:16:25] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:16:25] [INFO ] Deduced a trap composed of 223 places in 484 ms of which 2 ms to minimize.
[2024-06-01 14:16:26] [INFO ] Deduced a trap composed of 199 places in 516 ms of which 3 ms to minimize.
[2024-06-01 14:16:26] [INFO ] Deduced a trap composed of 190 places in 482 ms of which 2 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 211 places in 469 ms of which 2 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 189 places in 505 ms of which 2 ms to minimize.
[2024-06-01 14:16:29] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:16:31] [INFO ] Deduced a trap composed of 206 places in 472 ms of which 3 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 15 places in 486 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 65 places in 374 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 50 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 14/14 constraints]
After SMT, in 59601ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 59636ms
[2024-06-01 14:16:53] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:16:53] [INFO ] Invariant cache hit.
[2024-06-01 14:16:53] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-06-01 14:16:53] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:16:53] [INFO ] Invariant cache hit.
[2024-06-01 14:16:54] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:17:03] [INFO ] Implicit Places using invariants and state equation in 9540 ms returned []
Implicit Place search using SMT with State Equation took 10121 ms to find 0 implicit places.
[2024-06-01 14:17:03] [INFO ] Redundant transitions in 124 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:17:03] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:17:03] [INFO ] Invariant cache hit.
[2024-06-01 14:17:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:17:36] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 10 ms to minimize.
[2024-06-01 14:17:36] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:17:36] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:17:36] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:17:36] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:17:37] [INFO ] Deduced a trap composed of 223 places in 530 ms of which 3 ms to minimize.
[2024-06-01 14:17:38] [INFO ] Deduced a trap composed of 199 places in 435 ms of which 3 ms to minimize.
[2024-06-01 14:17:38] [INFO ] Deduced a trap composed of 190 places in 365 ms of which 2 ms to minimize.
[2024-06-01 14:17:38] [INFO ] Deduced a trap composed of 211 places in 353 ms of which 2 ms to minimize.
[2024-06-01 14:17:39] [INFO ] Deduced a trap composed of 189 places in 449 ms of which 3 ms to minimize.
[2024-06-01 14:17:40] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:17:43] [INFO ] Deduced a trap composed of 206 places in 497 ms of which 3 ms to minimize.
[2024-06-01 14:17:43] [INFO ] Deduced a trap composed of 15 places in 374 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:17:57] [INFO ] Deduced a trap composed of 65 places in 354 ms of which 2 ms to minimize.
[2024-06-01 14:18:23] [INFO ] Deduced a trap composed of 65 places in 375 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 51 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 15/15 constraints]
After SMT, in 80146ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 80167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 150111 ms. Remains : 422/422 places, 2232/2232 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 292 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1979 reset in 686 ms.
Product exploration explored 100000 steps with 2000 reset in 551 ms.
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 422/422 places, 2232/2232 transitions.
Applied a total of 0 rules in 31 ms. Remains 422 /422 variables (removed 0) and now considering 2232/2232 (removed 0) transitions.
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:18:25] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:18:25] [INFO ] Invariant cache hit.
[2024-06-01 14:18:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:19:00] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:19:00] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 0 ms to minimize.
[2024-06-01 14:19:00] [INFO ] Deduced a trap composed of 223 places in 475 ms of which 3 ms to minimize.
[2024-06-01 14:19:01] [INFO ] Deduced a trap composed of 199 places in 436 ms of which 3 ms to minimize.
[2024-06-01 14:19:01] [INFO ] Deduced a trap composed of 190 places in 404 ms of which 2 ms to minimize.
[2024-06-01 14:19:02] [INFO ] Deduced a trap composed of 211 places in 480 ms of which 4 ms to minimize.
[2024-06-01 14:19:02] [INFO ] Deduced a trap composed of 189 places in 424 ms of which 3 ms to minimize.
[2024-06-01 14:19:03] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:19:06] [INFO ] Deduced a trap composed of 206 places in 444 ms of which 3 ms to minimize.
[2024-06-01 14:19:06] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 2 ms to minimize.
SMT process timed out in 41409ms, After SMT, problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 41432ms
[2024-06-01 14:19:06] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:19:06] [INFO ] Invariant cache hit.
[2024-06-01 14:19:07] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-01 14:19:07] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:19:07] [INFO ] Invariant cache hit.
[2024-06-01 14:19:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:19:17] [INFO ] Implicit Places using invariants and state equation in 9866 ms returned []
Implicit Place search using SMT with State Equation took 10381 ms to find 0 implicit places.
[2024-06-01 14:19:17] [INFO ] Redundant transitions in 33 ms returned []
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:19:17] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
[2024-06-01 14:19:17] [INFO ] Invariant cache hit.
[2024-06-01 14:19:17] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:19:51] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:19:52] [INFO ] Deduced a trap composed of 223 places in 581 ms of which 4 ms to minimize.
[2024-06-01 14:19:53] [INFO ] Deduced a trap composed of 199 places in 501 ms of which 2 ms to minimize.
[2024-06-01 14:19:53] [INFO ] Deduced a trap composed of 190 places in 458 ms of which 3 ms to minimize.
[2024-06-01 14:19:54] [INFO ] Deduced a trap composed of 211 places in 443 ms of which 2 ms to minimize.
[2024-06-01 14:19:54] [INFO ] Deduced a trap composed of 189 places in 439 ms of which 2 ms to minimize.
[2024-06-01 14:19:55] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:19:58] [INFO ] Deduced a trap composed of 206 places in 520 ms of which 3 ms to minimize.
[2024-06-01 14:19:59] [INFO ] Deduced a trap composed of 15 places in 522 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:20:11] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 50 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 14/14 constraints]
After SMT, in 81208ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 81230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133125 ms. Remains : 422/422 places, 2232/2232 transitions.
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-02 finished in 440108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 37 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 27 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:20:38] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 14:20:38] [INFO ] Computed 42 invariants in 45 ms
[2024-06-01 14:20:38] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:21:18] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:21:18] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:21:19] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 40 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:21:22] [INFO ] Deduced a trap composed of 151 places in 453 ms of which 3 ms to minimize.
[2024-06-01 14:21:23] [INFO ] Deduced a trap composed of 84 places in 537 ms of which 4 ms to minimize.
[2024-06-01 14:21:24] [INFO ] Deduced a trap composed of 347 places in 563 ms of which 4 ms to minimize.
[2024-06-01 14:21:32] [INFO ] Deduced a trap composed of 354 places in 344 ms of which 3 ms to minimize.
[2024-06-01 14:21:38] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 45 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 9/9 constraints]
After SMT, in 60832ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60856ms
[2024-06-01 14:21:39] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:21:39] [INFO ] Invariant cache hit.
[2024-06-01 14:21:40] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 14:21:40] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:21:40] [INFO ] Invariant cache hit.
[2024-06-01 14:21:40] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:21:52] [INFO ] Implicit Places using invariants and state equation in 12053 ms returned []
Implicit Place search using SMT with State Equation took 12669 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:21:52] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:21:52] [INFO ] Invariant cache hit.
[2024-06-01 14:21:52] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:22:34] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:22:34] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:22:34] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:22:34] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:22:34] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:22:35] [INFO ] Deduced a trap composed of 411 places in 507 ms of which 5 ms to minimize.
[2024-06-01 14:22:36] [INFO ] Deduced a trap composed of 367 places in 465 ms of which 4 ms to minimize.
[2024-06-01 14:22:36] [INFO ] Deduced a trap composed of 356 places in 466 ms of which 4 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 137 places in 434 ms of which 4 ms to minimize.
[2024-06-01 14:22:37] [INFO ] Deduced a trap composed of 176 places in 412 ms of which 4 ms to minimize.
[2024-06-01 14:22:38] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:22:39] [INFO ] Deduced a trap composed of 314 places in 506 ms of which 4 ms to minimize.
[2024-06-01 14:22:39] [INFO ] Deduced a trap composed of 338 places in 482 ms of which 5 ms to minimize.
[2024-06-01 14:22:42] [INFO ] Deduced a trap composed of 388 places in 537 ms of which 5 ms to minimize.
SMT process timed out in 50537ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 50561ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124123 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-07
Stuttering criterion allowed to conclude after 393 steps with 2 reset in 4 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-07 finished in 124282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 54 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 614 transition count 2394
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 584 transition count 2388
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 578 transition count 2388
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 72 place count 578 transition count 2316
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 216 place count 506 transition count 2316
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 288 place count 470 transition count 2280
Applied a total of 288 rules in 92 ms. Remains 470 /614 variables (removed 144) and now considering 2280/2424 (removed 144) transitions.
Running 2274 sub problems to find dead transitions.
[2024-06-01 14:22:42] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
// Phase 1: matrix 2244 rows 470 cols
[2024-06-01 14:22:42] [INFO ] Computed 42 invariants in 47 ms
[2024-06-01 14:22:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-06-01 14:23:17] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:23:17] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:23:17] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:23:17] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:23:17] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:23:18] [INFO ] Deduced a trap composed of 220 places in 459 ms of which 4 ms to minimize.
[2024-06-01 14:23:18] [INFO ] Deduced a trap composed of 215 places in 485 ms of which 4 ms to minimize.
[2024-06-01 14:23:19] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 220 places in 522 ms of which 3 ms to minimize.
[2024-06-01 14:23:21] [INFO ] Deduced a trap composed of 47 places in 355 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2714 variables, and 46 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2274/1020 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-06-01 14:23:25] [INFO ] Deduced a trap composed of 223 places in 401 ms of which 3 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2714 variables, and 48 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1020 constraints, Known Traps: 12/12 constraints]
After SMT, in 59703ms problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 59726ms
[2024-06-01 14:23:42] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-06-01 14:23:42] [INFO ] Invariant cache hit.
[2024-06-01 14:23:43] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 14:23:43] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-06-01 14:23:43] [INFO ] Invariant cache hit.
[2024-06-01 14:23:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:23:50] [INFO ] Implicit Places using invariants and state equation in 7639 ms returned []
Implicit Place search using SMT with State Equation took 8256 ms to find 0 implicit places.
[2024-06-01 14:23:50] [INFO ] Redundant transitions in 81 ms returned []
Running 2274 sub problems to find dead transitions.
[2024-06-01 14:23:51] [INFO ] Flow matrix only has 2244 transitions (discarded 36 similar events)
[2024-06-01 14:23:51] [INFO ] Invariant cache hit.
[2024-06-01 14:23:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 3 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 224 places in 369 ms of which 3 ms to minimize.
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 225 places in 523 ms of which 3 ms to minimize.
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 231 places in 478 ms of which 3 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/2714 variables, and 46 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2274/1020 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 2274 unsolved
[2024-06-01 14:24:46] [INFO ] Deduced a trap composed of 188 places in 406 ms of which 4 ms to minimize.
[2024-06-01 14:24:48] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/2714 variables, and 48 constraints, problems are : Problem set: 0 solved, 2274 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/470 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1020 constraints, Known Traps: 12/12 constraints]
After SMT, in 80045ms problems are : Problem set: 0 solved, 2274 unsolved
Search for dead transitions found 0 dead transitions in 80078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 470/614 places, 2280/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148251 ms. Remains : 470/614 places, 2280/2424 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-10
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-10 finished in 148347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((X(G(p1))&&(p2 U (p1||G(p2)))))&&p0))))'
Support contains 19 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 44 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:25:11] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 14:25:11] [INFO ] Computed 42 invariants in 88 ms
[2024-06-01 14:25:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 39476ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 39515ms
[2024-06-01 14:25:50] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:25:50] [INFO ] Invariant cache hit.
[2024-06-01 14:25:51] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-06-01 14:25:51] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:25:51] [INFO ] Invariant cache hit.
[2024-06-01 14:25:51] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:26:05] [INFO ] Implicit Places using invariants and state equation in 14416 ms returned []
Implicit Place search using SMT with State Equation took 14946 ms to find 0 implicit places.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:26:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:26:05] [INFO ] Invariant cache hit.
[2024-06-01 14:26:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:26:43] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:26:43] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:26:43] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:26:43] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:26:43] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:26:44] [INFO ] Deduced a trap composed of 411 places in 357 ms of which 3 ms to minimize.
[2024-06-01 14:26:44] [INFO ] Deduced a trap composed of 367 places in 333 ms of which 3 ms to minimize.
[2024-06-01 14:26:45] [INFO ] Deduced a trap composed of 356 places in 337 ms of which 3 ms to minimize.
[2024-06-01 14:26:45] [INFO ] Deduced a trap composed of 137 places in 331 ms of which 3 ms to minimize.
[2024-06-01 14:26:46] [INFO ] Deduced a trap composed of 176 places in 324 ms of which 3 ms to minimize.
[2024-06-01 14:26:46] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:26:47] [INFO ] Deduced a trap composed of 314 places in 438 ms of which 4 ms to minimize.
[2024-06-01 14:26:48] [INFO ] Deduced a trap composed of 338 places in 408 ms of which 4 ms to minimize.
[2024-06-01 14:26:50] [INFO ] Deduced a trap composed of 388 places in 639 ms of which 4 ms to minimize.
[2024-06-01 14:26:51] [INFO ] Deduced a trap composed of 350 places in 562 ms of which 3 ms to minimize.
[2024-06-01 14:26:51] [INFO ] Deduced a trap composed of 384 places in 574 ms of which 3 ms to minimize.
[2024-06-01 14:26:52] [INFO ] Deduced a trap composed of 385 places in 557 ms of which 3 ms to minimize.
[2024-06-01 14:26:52] [INFO ] Deduced a trap composed of 343 places in 526 ms of which 4 ms to minimize.
[2024-06-01 14:26:53] [INFO ] Deduced a trap composed of 368 places in 699 ms of which 4 ms to minimize.
[2024-06-01 14:26:54] [INFO ] Deduced a trap composed of 359 places in 479 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 56 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 42 places in 310 ms of which 2 ms to minimize.
[2024-06-01 14:27:04] [INFO ] Deduced a trap composed of 133 places in 369 ms of which 3 ms to minimize.
[2024-06-01 14:27:06] [INFO ] Deduced a trap composed of 82 places in 410 ms of which 2 ms to minimize.
[2024-06-01 14:27:07] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:27:12] [INFO ] Deduced a trap composed of 327 places in 565 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 61 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 25/25 constraints]
After SMT, in 79577ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 79605ms
Starting structural reductions in LTL mode, iteration 1 : 608/614 places, 2418/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134129 ms. Remains : 608/614 places, 2418/2424 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-12 finished in 134357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 614 transition count 2388
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 578 transition count 2388
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 578 transition count 2316
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 216 place count 506 transition count 2316
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 360 place count 434 transition count 2244
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 366 place count 428 transition count 2238
Iterating global reduction 2 with 6 rules applied. Total rules applied 372 place count 428 transition count 2238
Applied a total of 372 rules in 133 ms. Remains 428 /614 variables (removed 186) and now considering 2238/2424 (removed 186) transitions.
Running 2232 sub problems to find dead transitions.
[2024-06-01 14:27:25] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
// Phase 1: matrix 2202 rows 428 cols
[2024-06-01 14:27:25] [INFO ] Computed 42 invariants in 37 ms
[2024-06-01 14:27:25] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:28:01] [INFO ] Deduced a trap composed of 189 places in 570 ms of which 4 ms to minimize.
[2024-06-01 14:28:01] [INFO ] Deduced a trap composed of 183 places in 483 ms of which 3 ms to minimize.
[2024-06-01 14:28:02] [INFO ] Deduced a trap composed of 47 places in 346 ms of which 2 ms to minimize.
[2024-06-01 14:28:02] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 45 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 14:28:08] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-06-01 14:28:10] [INFO ] Deduced a trap composed of 184 places in 377 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 47 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 11/11 constraints]
After SMT, in 59859ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 59892ms
[2024-06-01 14:28:25] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-06-01 14:28:25] [INFO ] Invariant cache hit.
[2024-06-01 14:28:25] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 14:28:25] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-06-01 14:28:25] [INFO ] Invariant cache hit.
[2024-06-01 14:28:26] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:28:31] [INFO ] Implicit Places using invariants and state equation in 5076 ms returned []
Implicit Place search using SMT with State Equation took 5502 ms to find 0 implicit places.
[2024-06-01 14:28:31] [INFO ] Redundant transitions in 62 ms returned []
Running 2232 sub problems to find dead transitions.
[2024-06-01 14:28:31] [INFO ] Flow matrix only has 2202 transitions (discarded 36 similar events)
[2024-06-01 14:28:31] [INFO ] Invariant cache hit.
[2024-06-01 14:28:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 14:29:04] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:29:04] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:29:05] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:29:05] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:29:05] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:29:05] [INFO ] Deduced a trap composed of 189 places in 487 ms of which 3 ms to minimize.
[2024-06-01 14:29:06] [INFO ] Deduced a trap composed of 178 places in 437 ms of which 2 ms to minimize.
[2024-06-01 14:29:06] [INFO ] Deduced a trap composed of 183 places in 425 ms of which 3 ms to minimize.
[2024-06-01 14:29:07] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
(s353 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 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 9.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.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 1.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)
(s190 0.0)
(s191 0.0)
(s192 1.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 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 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 6.0)
(s322 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/2630 variables, and 45 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2232/978 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 2232 unsolved
[2024-06-01 14:29:27] [INFO ] Deduced a trap composed of 184 places in 375 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2630 variables, and 46 constraints, problems are : Problem set: 0 solved, 2232 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/19 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/428 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/978 constraints, Known Traps: 10/10 constraints]
After SMT, in 79782ms problems are : Problem set: 0 solved, 2232 unsolved
Search for dead transitions found 0 dead transitions in 79809ms
Starting structural reductions in SI_LTL mode, iteration 1 : 428/614 places, 2238/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145416 ms. Remains : 428/614 places, 2238/2424 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-14 finished in 145464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 614 transition count 2382
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 572 transition count 2382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 572 transition count 2310
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 500 transition count 2310
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 384 place count 422 transition count 2232
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 416 transition count 2226
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 416 transition count 2226
Applied a total of 396 rules in 152 ms. Remains 416 /614 variables (removed 198) and now considering 2226/2424 (removed 198) transitions.
Running 2220 sub problems to find dead transitions.
[2024-06-01 14:29:51] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
// Phase 1: matrix 2190 rows 416 cols
[2024-06-01 14:29:51] [INFO ] Computed 42 invariants in 70 ms
[2024-06-01 14:29:51] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 0 ms to minimize.
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 188 places in 397 ms of which 3 ms to minimize.
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 52 places in 331 ms of which 2 ms to minimize.
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 178 places in 382 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 44 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2220/966 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 14:30:34] [INFO ] Deduced a trap composed of 15 places in 407 ms of which 3 ms to minimize.
[2024-06-01 14:30:34] [INFO ] Deduced a trap composed of 177 places in 407 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 46 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/966 constraints, Known Traps: 10/10 constraints]
After SMT, in 59956ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 59977ms
[2024-06-01 14:30:51] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-06-01 14:30:51] [INFO ] Invariant cache hit.
[2024-06-01 14:30:51] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-06-01 14:30:51] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-06-01 14:30:51] [INFO ] Invariant cache hit.
[2024-06-01 14:30:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:30:58] [INFO ] Implicit Places using invariants and state equation in 6516 ms returned []
Implicit Place search using SMT with State Equation took 6961 ms to find 0 implicit places.
[2024-06-01 14:30:58] [INFO ] Redundant transitions in 69 ms returned []
Running 2220 sub problems to find dead transitions.
[2024-06-01 14:30:58] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
[2024-06-01 14:30:58] [INFO ] Invariant cache hit.
[2024-06-01 14:30:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 14:31:31] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:31:31] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:31:31] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:31:31] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:31:31] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:31:32] [INFO ] Deduced a trap composed of 188 places in 436 ms of which 2 ms to minimize.
[2024-06-01 14:31:32] [INFO ] Deduced a trap composed of 182 places in 441 ms of which 3 ms to minimize.
[2024-06-01 14:31:33] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 3 ms to minimize.
[2024-06-01 14:31:33] [INFO ] Deduced a trap composed of 177 places in 409 ms of which 3 ms to minimize.
[2024-06-01 14:31:33] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:31:36] [INFO ] Deduced a trap composed of 142 places in 302 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 47 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2220/966 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 132 places in 378 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 48 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/966 constraints, Known Traps: 12/12 constraints]
After SMT, in 80532ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 80563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 416/614 places, 2226/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147741 ms. Remains : 416/614 places, 2226/2424 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T06-LTLCardinality-15
Stuttering criterion allowed to conclude after 5196 steps with 109 reset in 41 ms.
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J04T06-LTLCardinality-15 finished in 147885 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-06-01 14:32:19] [INFO ] Flatten gal took : 144 ms
[2024-06-01 14:32:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 14:32:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 614 places, 2424 transitions and 14814 arcs took 27 ms.
Total runtime 1304952 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-LTLCardinality-02

BK_STOP 1717252790896

--------------------
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-S06J04T06-LTLCardinality-02
ltl formula formula --ltl=/tmp/1631/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( 0/ 4): Petri net has 614 places, 2424 transitions and 14814 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1631/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1631/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.110 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1631/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1631/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 641 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 615, there are 2427 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~61 levels ~10000 states ~19728 transitions
pnml2lts-mc( 1/ 4): ~288 levels ~20000 states ~52340 transitions
pnml2lts-mc( 1/ 4): ~288 levels ~40000 states ~127564 transitions
pnml2lts-mc( 1/ 4): ~288 levels ~80000 states ~276784 transitions
pnml2lts-mc( 3/ 4): ~405 levels ~160000 states ~612140 transitions
pnml2lts-mc( 3/ 4): ~607 levels ~320000 states ~1262540 transitions
pnml2lts-mc( 3/ 4): ~978 levels ~640000 states ~2403552 transitions
pnml2lts-mc( 3/ 4): ~1954 levels ~1280000 states ~5075124 transitions
pnml2lts-mc( 3/ 4): ~3795 levels ~2560000 states ~10395284 transitions
pnml2lts-mc( 2/ 4): ~138289 levels ~5120000 states ~19393128 transitions
pnml2lts-mc( 2/ 4): ~326078 levels ~10240000 states ~36878988 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8142531
pnml2lts-mc( 0/ 4): unique states count: 10046308
pnml2lts-mc( 0/ 4): unique transitions count: 33616600
pnml2lts-mc( 0/ 4): - self-loop count: 107478
pnml2lts-mc( 0/ 4): - claim dead count: 21403793
pnml2lts-mc( 0/ 4): - claim found count: 609415
pnml2lts-mc( 0/ 4): - claim success count: 10046343
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1424186
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10046347 states 33616759 transitions, fanout: 3.346
pnml2lts-mc( 0/ 4): Total exploration time 450.160 sec (450.080 sec minimum, 450.105 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22317, Transitions per second: 74677
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 151.1MB, 13.9 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 34.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2481 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 151.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-S06J04T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446500179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;