fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r476-tall-171620505400219
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CSRepetitions-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1846.411 674052.00 776392.00 1435.60 TTTFTTTFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505400219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CSRepetitions-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505400219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.8K Apr 12 10:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 12 10:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:42 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 CSRepetitions-COL-10-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717201344149

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:22:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:22:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:22:25] [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 00:22:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 00:22:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2024-06-01 00:22:25] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 1311 PT places and 2300.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 00:22:25] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-06-01 00:22:25] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 40179 steps (256 resets) in 190 ms. (210 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40003 steps (68 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 00:22:26] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 00:22:26] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 2/11 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/6 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-01 00:22:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:22:26] [INFO ] Flatten gal took : 1 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 10
[2024-06-01 00:22:26] [INFO ] Unfolded HLPN to a Petri net with 402 places and 500 transitions 1500 arcs in 19 ms.
[2024-06-01 00:22:26] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 302 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2024-06-01 00:22:26] [INFO ] Computed 101 invariants in 24 ms
[2024-06-01 00:22:26] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 00:22:26] [INFO ] Invariant cache hit.
[2024-06-01 00:22:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:22:26] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:22:26] [INFO ] Invariant cache hit.
[2024-06-01 00:22:26] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29223 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29589 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 59609ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 59621ms
Finished structural reductions in LTL mode , in 1 iterations and 60012 ms. Remains : 402/402 places, 500/500 transitions.
Support contains 302 out of 402 places after structural reductions.
[2024-06-01 00:23:26] [INFO ] Flatten gal took : 38 ms
[2024-06-01 00:23:26] [INFO ] Flatten gal took : 35 ms
[2024-06-01 00:23:26] [INFO ] Input system was already deterministic with 500 transitions.
RANDOM walk for 40000 steps (272 resets) in 1282 ms. (31 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2024-06-01 00:23:27] [INFO ] Invariant cache hit.
[2024-06-01 00:23:27] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 300/402 variables, 102/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 500/902 variables, 300/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 100/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 2/902 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, State Equation: 0/402 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CSRepetitions-COL-10-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 100 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' '!((p0 U X(p1)))'
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 23 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:23:27] [INFO ] Invariant cache hit.
[2024-06-01 00:23:28] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 00:23:28] [INFO ] Invariant cache hit.
[2024-06-01 00:23:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:23:28] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:23:28] [INFO ] Invariant cache hit.
[2024-06-01 00:23:28] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27872 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27644 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 56184ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 56190ms
Finished structural reductions in LTL mode , in 1 iterations and 56593 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLCardinality-00 finished in 58260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1)&&F(G(!p1)))))))'
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:24:26] [INFO ] Invariant cache hit.
[2024-06-01 00:24:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 00:24:26] [INFO ] Invariant cache hit.
[2024-06-01 00:24:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:24:26] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:24:26] [INFO ] Invariant cache hit.
[2024-06-01 00:24:26] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27629 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28527 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 56725ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 56730ms
Finished structural reductions in LTL mode , in 1 iterations and 57115 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 529 ms.
Product exploration explored 100000 steps with 50000 reset in 571 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLCardinality-01 finished in 58502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:25:24] [INFO ] Invariant cache hit.
[2024-06-01 00:25:24] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 00:25:24] [INFO ] Invariant cache hit.
[2024-06-01 00:25:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:25:25] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:25:25] [INFO ] Invariant cache hit.
[2024-06-01 00:25:25] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28245 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28503 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 57312ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 57316ms
Finished structural reductions in LTL mode , in 1 iterations and 57834 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLCardinality-02 finished in 58799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:26:23] [INFO ] Invariant cache hit.
[2024-06-01 00:26:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 00:26:23] [INFO ] Invariant cache hit.
[2024-06-01 00:26:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:26:23] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:26:23] [INFO ] Invariant cache hit.
[2024-06-01 00:26:23] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28157 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 26884 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 55606ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 55612ms
Finished structural reductions in LTL mode , in 1 iterations and 56107 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-03 finished in 56244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:27:19] [INFO ] Invariant cache hit.
[2024-06-01 00:27:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 00:27:19] [INFO ] Invariant cache hit.
[2024-06-01 00:27:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:27:20] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:27:20] [INFO ] Invariant cache hit.
[2024-06-01 00:27:20] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27533 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29056 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 57145ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 57151ms
Finished structural reductions in LTL mode , in 1 iterations and 57519 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLCardinality-04 finished in 58512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1))||(p2&&X(p3)))))'
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:28:18] [INFO ] Invariant cache hit.
[2024-06-01 00:28:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 00:28:18] [INFO ] Invariant cache hit.
[2024-06-01 00:28:18] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:28:18] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:28:18] [INFO ] Invariant cache hit.
[2024-06-01 00:28:18] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27430 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28355 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 56339ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 56345ms
Finished structural reductions in LTL mode , in 1 iterations and 56744 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 941 ms.
Product exploration explored 100000 steps with 33333 reset in 1001 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) p2 p1), (X p2), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 p1 p2))), (X p1), (X (X (NOT (AND p1 (NOT p3))))), (X (X p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 65 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLCardinality-06 finished in 59106 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 U (p1||G(p0))))))'
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 29 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:29:17] [INFO ] Invariant cache hit.
[2024-06-01 00:29:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 00:29:17] [INFO ] Invariant cache hit.
[2024-06-01 00:29:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:29:17] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 00:29:17] [INFO ] Redundant transitions in 31 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 00:29:17] [INFO ] Invariant cache hit.
[2024-06-01 00:29:17] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28377 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27533 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 56490ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 56494ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56937 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-07
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 8 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-07 finished in 57052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(!p0)||F(p1))))'
Support contains 100 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:30:14] [INFO ] Invariant cache hit.
[2024-06-01 00:30:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 00:30:14] [INFO ] Invariant cache hit.
[2024-06-01 00:30:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:30:14] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:30:14] [INFO ] Invariant cache hit.
[2024-06-01 00:30:14] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 27952 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29024 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 57537ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 57544ms
Finished structural reductions in LTL mode , in 1 iterations and 57932 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), false, false, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-09
Stuttering criterion allowed to conclude after 5921 steps with 94 reset in 67 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-09 finished in 58237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 200 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:31:12] [INFO ] Invariant cache hit.
[2024-06-01 00:31:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 00:31:12] [INFO ] Invariant cache hit.
[2024-06-01 00:31:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:31:12] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 00:31:12] [INFO ] Invariant cache hit.
[2024-06-01 00:31:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29272 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29632 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 59492ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 59498ms
Finished structural reductions in LTL mode , in 1 iterations and 59784 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-11 finished in 59957 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 101 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 27 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-06-01 00:32:12] [INFO ] Invariant cache hit.
[2024-06-01 00:32:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 00:32:12] [INFO ] Invariant cache hit.
[2024-06-01 00:32:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 00:32:13] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-01 00:32:13] [INFO ] Redundant transitions in 35 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 00:32:13] [INFO ] Invariant cache hit.
[2024-06-01 00:32:13] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 29663 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 28707 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 58941ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 58945ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59550 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-13
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 6 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-13 finished in 59659 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 101 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 202 transition count 400
Applied a total of 300 rules in 41 ms. Remains 202 /402 variables (removed 200) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 202 cols
[2024-06-01 00:33:12] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 00:33:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 00:33:12] [INFO ] Invariant cache hit.
[2024-06-01 00:33:12] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-01 00:33:12] [INFO ] Redundant transitions in 14 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 00:33:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 203 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 300/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/602 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 503 constraints, problems are : Problem set: 0 solved, 300 unsolved in 13916 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 25195ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 25198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 202/402 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25412 ms. Remains : 202/402 places, 400/500 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-14
Stuttering criterion allowed to conclude after 33151 steps with 2309 reset in 153 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-14 finished in 25663 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 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 202 transition count 400
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 399 place count 103 transition count 301
Iterating global reduction 0 with 99 rules applied. Total rules applied 498 place count 103 transition count 301
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 597 place count 4 transition count 103
Iterating global reduction 0 with 99 rules applied. Total rules applied 696 place count 4 transition count 103
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 795 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 798 place count 2 transition count 3
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 799 place count 2 transition count 3
Applied a total of 799 rules in 50 ms. Remains 2 /402 variables (removed 400) and now considering 3/500 (removed 497) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 00:33:37] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 00:33:37] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-06-01 00:33:37] [INFO ] Invariant cache hit.
[2024-06-01 00:33:37] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2024-06-01 00:33:37] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 00:33:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 36ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/402 places, 3/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 2/402 places, 3/500 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 3212 reset in 142 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-15 finished in 314 ms.
All properties solved by simple procedures.
Total runtime 672937 ms.
ITS solved all properties within timeout

BK_STOP 1717202018201

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-10"
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 CSRepetitions-COL-10, 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 r476-tall-171620505400219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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