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.r544-smll-171701110700091.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 UtilityControlRoom-COL-Z4T3N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110700091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.3K Apr 13 05:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 13 05:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 05:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 06:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 06:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717261231267

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T3N08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:00:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:00:33] [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 17:00:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:00:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1029 ms
[2024-06-01 17:00:34] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 302 PT places and 600.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:00:34] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-06-01 17:00:34] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 29389 steps (6 resets) in 647 ms. (45 steps per ms) remains 0/28 properties
[2024-06-01 17:00:34] [INFO ] Flatten gal took : 24 ms
[2024-06-01 17:00:34] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-06-01 17:00:34] [INFO ] Unfolded HLPN to a Petri net with 302 places and 600 transitions 1928 arcs in 43 ms.
[2024-06-01 17:00:34] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 294 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 16 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-06-01 17:00:35] [INFO ] Computed 19 invariants in 43 ms
[2024-06-01 17:00:35] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 17:00:35] [INFO ] Invariant cache hit.
[2024-06-01 17:00:35] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-06-01 17:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 321 constraints, problems are : Problem set: 0 solved, 464 unsolved in 29089 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 8/302 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 464/785 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 785 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Finished structural reductions in LTL mode , in 1 iterations and 61174 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 294 out of 302 places after structural reductions.
[2024-06-01 17:01:36] [INFO ] Flatten gal took : 78 ms
[2024-06-01 17:01:36] [INFO ] Flatten gal took : 46 ms
[2024-06-01 17:01:36] [INFO ] Input system was already deterministic with 472 transitions.
RANDOM walk for 40000 steps (8 resets) in 2096 ms. (19 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 771 ms. (51 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 1/2 properties
[2024-06-01 17:01:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 273/298 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/302 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/774 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 273/298 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/302 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 472/774 variables, 302/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/774 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4341 steps, including 68 resets, run visited all 1 properties in 75 ms. (steps per millisecond=57 )
Parikh walk visited 1 properties in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 32 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 171 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 171 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 147 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 147 transition count 192
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 375 place count 130 transition count 176
Applied a total of 375 rules in 78 ms. Remains 130 /302 variables (removed 172) and now considering 176/472 (removed 296) transitions.
// Phase 1: matrix 176 rows 130 cols
[2024-06-01 17:01:38] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 17:01:38] [INFO ] Implicit Places using invariants in 104 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/302 places, 176/472 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 121 transition count 168
Applied a total of 16 rules in 18 ms. Remains 121 /129 variables (removed 8) and now considering 168/176 (removed 8) transitions.
// Phase 1: matrix 168 rows 121 cols
[2024-06-01 17:01:38] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 17:01:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 17:01:38] [INFO ] Invariant cache hit.
[2024-06-01 17:01:38] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/302 places, 168/472 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 431 ms. Remains : 121/302 places, 168/472 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 596 ms.
Stack based approach found an accepted trace after 593 steps with 0 reset with depth 594 and stack size 594 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-00 finished in 1329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 68 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 12 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 17:01:39] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 17:01:40] [INFO ] Implicit Places using invariants in 160 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 23750 steps with 0 reset in 149 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-01 finished in 430 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((X(X((p0&&F(G(p1)))))||(p1 U (p2||G(p1)))))))'
Support contains 70 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 11 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-06-01 17:01:40] [INFO ] Invariant cache hit.
[2024-06-01 17:01:40] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 17:01:40] [INFO ] Invariant cache hit.
[2024-06-01 17:01:40] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 17:01:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 17107 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 47803ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 47808ms
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48255 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-02 finished in 48684 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)&&X(F(p1)))))'
Support contains 172 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-06-01 17:02:28] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 17:02:29] [INFO ] Implicit Places using invariants in 176 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-03 finished in 366 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)&&F(G(p1)))))'
Support contains 48 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 291 place count 171 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 294 place count 171 transition count 216
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 318 place count 147 transition count 192
Iterating global reduction 2 with 24 rules applied. Total rules applied 342 place count 147 transition count 192
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 358 place count 139 transition count 184
Applied a total of 358 rules in 40 ms. Remains 139 /302 variables (removed 163) and now considering 184/472 (removed 288) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-06-01 17:02:29] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 17:02:29] [INFO ] Implicit Places using invariants in 104 ms returned [0, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/302 places, 184/472 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 137/302 places, 184/472 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04
Product exploration explored 100000 steps with 5 reset in 312 ms.
Product exploration explored 100000 steps with 32 reset in 507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 23374 steps (5 resets) in 120 ms. (193 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 48 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 137 cols
[2024-06-01 17:02:31] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 17:02:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 17:02:31] [INFO ] Invariant cache hit.
[2024-06-01 17:02:31] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-01 17:02:31] [INFO ] Redundant transitions in 7 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 17:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 154 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4791 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 152/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 306 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5269 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 10120ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 10123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10480 ms. Remains : 137/137 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/2 properties
BEST_FIRST walk for 632 steps (0 resets) in 6 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 21 reset in 297 ms.
Product exploration explored 100000 steps with 6 reset in 353 ms.
Support contains 48 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-06-01 17:02:43] [INFO ] Invariant cache hit.
[2024-06-01 17:02:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 17:02:43] [INFO ] Invariant cache hit.
[2024-06-01 17:02:43] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 17:02:43] [INFO ] Redundant transitions in 7 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 17:02:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 154 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4979 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/137 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 184/321 variables, 137/154 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 152/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 306 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5440 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 10465ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 10468ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10705 ms. Remains : 137/137 places, 184/184 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04 finished in 24624 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(p0))||F(p1)) U (G((p1 U p2))||G(p1))))'
Support contains 49 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 4 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 17:02:53] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 17:02:54] [INFO ] Implicit Places using invariants in 183 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05
Product exploration explored 100000 steps with 19889 reset in 364 ms.
Product exploration explored 100000 steps with 19741 reset in 337 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 383 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 30016 steps (6 resets) in 208 ms. (143 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p2 p0)))]
Knowledge based reduction with 12 factoid took 938 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-06-01 17:02:57] [INFO ] Computed 18 invariants in 2 ms
[2024-06-01 17:02:57] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 17:02:57] [INFO ] Invariant cache hit.
[2024-06-01 17:02:58] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 17:02:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 17110 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 47754ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 47758ms
Finished structural reductions in LTL mode , in 1 iterations and 48177 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 389 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 1/11 properties
BEST_FIRST walk for 711 steps (0 resets) in 6 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p2 p0)))]
Knowledge based reduction with 12 factoid took 820 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 19947 reset in 351 ms.
Product exploration explored 100000 steps with 19932 reset in 363 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 205 transition count 400
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 40 rules in 24 ms. Remains 205 /205 variables (removed 0) and now considering 400/376 (removed -24) transitions.
[2024-06-01 17:03:49] [INFO ] Redundant transitions in 9 ms returned []
Running 368 sub problems to find dead transitions.
// Phase 1: matrix 400 rows 205 cols
[2024-06-01 17:03:49] [INFO ] Computed 18 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 9 ms to minimize.
[2024-06-01 17:03:54] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-06-01 17:03:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 11/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 400/605 variables, 205/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 234 constraints, problems are : Problem set: 64 solved, 304 unsolved in 17209 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 64 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 48/205 variables, 18/18 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 11/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 400/605 variables, 205/234 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 304/538 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/538 constraints. Problems are: Problem set: 64 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/538 constraints. Problems are: Problem set: 64 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 538 constraints, problems are : Problem set: 64 solved, 304 unsolved in 24431 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 304/368 constraints, Known Traps: 11/11 constraints]
After SMT, in 42244ms problems are : Problem set: 64 solved, 304 unsolved
Search for dead transitions found 64 dead transitions in 42249ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 336/376 transitions.
Graph (complete) has 560 edges and 205 vertex of which 165 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 165 /205 variables (removed 40) and now considering 336/336 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/205 places, 336/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42307 ms. Remains : 165/205 places, 336/376 transitions.
Support contains 49 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-06-01 17:04:32] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 17:04:32] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 17:04:32] [INFO ] Invariant cache hit.
[2024-06-01 17:04:32] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 17:04:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 223 constraints, problems are : Problem set: 0 solved, 368 unsolved in 16656 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/205 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/581 variables, 205/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/581 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 591 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 47237ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 47242ms
Finished structural reductions in LTL mode , in 1 iterations and 47727 ms. Remains : 205/205 places, 376/376 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05 finished in 145903 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 25 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
Applied a total of 542 rules in 41 ms. Remains 59 /302 variables (removed 243) and now considering 56/472 (removed 416) transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-06-01 17:05:19] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 17:05:19] [INFO ] Implicit Places using invariants in 59 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/302 places, 56/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 58/302 places, 56/472 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06
Product exploration explored 100000 steps with 1 reset in 236 ms.
Product exploration explored 100000 steps with 2 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23414 steps (5 resets) in 57 ms. (403 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 25 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 58 cols
[2024-06-01 17:05:20] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 17:05:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 17:05:21] [INFO ] Invariant cache hit.
[2024-06-01 17:05:21] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-06-01 17:05:21] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 17:05:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 0 solved, 48 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 124 constraints, problems are : Problem set: 0 solved, 48 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1859ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1860ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2001 ms. Remains : 58/58 places, 56/56 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21925 steps (4 resets) in 52 ms. (413 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 224 ms.
Product exploration explored 100000 steps with 1 reset in 264 ms.
Support contains 25 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 17:05:24] [INFO ] Invariant cache hit.
[2024-06-01 17:05:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 17:05:24] [INFO ] Invariant cache hit.
[2024-06-01 17:05:24] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-01 17:05:24] [INFO ] Redundant transitions in 4 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 17:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 0 solved, 48 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 124 constraints, problems are : Problem set: 0 solved, 48 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1953ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2107 ms. Remains : 58/58 places, 56/56 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06 finished in 6309 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' '!((!(p0 U p1)&&X(F(!p0))))'
Support contains 136 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-06-01 17:05:26] [INFO ] Computed 19 invariants in 7 ms
[2024-06-01 17:05:26] [INFO ] Implicit Places using invariants in 291 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 296 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 301/302 places, 472/472 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, (OR p0 p1), true, (OR p1 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 711 ms.
Product exploration explored 100000 steps with 50000 reset in 552 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-08 finished in 1794 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 2 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 139 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 139 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 115 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 115 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 91 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 91 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 67 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 67 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 67 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 526 place count 67 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 542 place count 59 transition count 56
Applied a total of 542 rules in 26 ms. Remains 59 /302 variables (removed 243) and now considering 56/472 (removed 416) transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-06-01 17:05:28] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 17:05:28] [INFO ] Implicit Places using invariants in 77 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/302 places, 56/472 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 58/302 places, 56/472 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 4 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30005 steps (6 resets) in 61 ms. (483 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 58 cols
[2024-06-01 17:05:29] [INFO ] Computed 18 invariants in 5 ms
[2024-06-01 17:05:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 17:05:29] [INFO ] Invariant cache hit.
[2024-06-01 17:05:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-01 17:05:29] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 17:05:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 0 solved, 48 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 124 constraints, problems are : Problem set: 0 solved, 48 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1855ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1856ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2012 ms. Remains : 58/58 places, 56/56 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33336 steps (7 resets) in 67 ms. (490 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 210 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 17:05:32] [INFO ] Invariant cache hit.
[2024-06-01 17:05:32] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 17:05:32] [INFO ] Invariant cache hit.
[2024-06-01 17:05:32] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-01 17:05:32] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 17:05:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 0 solved, 48 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 8/58 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/114 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 124 constraints, problems are : Problem set: 0 solved, 48 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1758ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1759ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1908 ms. Remains : 58/58 places, 56/56 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 finished in 6016 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||G(p1)))))'
Support contains 44 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 302 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 174 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 174 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 142 transition count 280
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 368 place count 134 transition count 272
Applied a total of 368 rules in 20 ms. Remains 134 /302 variables (removed 168) and now considering 272/472 (removed 200) transitions.
// Phase 1: matrix 272 rows 134 cols
[2024-06-01 17:05:33] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 17:05:34] [INFO ] Implicit Places using invariants in 118 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/302 places, 272/472 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 133/302 places, 272/472 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 538 ms.
Stack based approach found an accepted trace after 9877 steps with 0 reset with depth 9878 and stack size 9878 in 56 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-10 finished in 830 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(p0)||F(p1)))'
Support contains 69 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 208 place count 198 transition count 368
Applied a total of 208 rules in 16 ms. Remains 198 /302 variables (removed 104) and now considering 368/472 (removed 104) transitions.
// Phase 1: matrix 368 rows 198 cols
[2024-06-01 17:05:34] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 17:05:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 17:05:34] [INFO ] Invariant cache hit.
[2024-06-01 17:05:35] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-01 17:05:35] [INFO ] Redundant transitions in 3 ms returned []
Running 360 sub problems to find dead transitions.
[2024-06-01 17:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 368/566 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/566 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 217 constraints, problems are : Problem set: 0 solved, 360 unsolved in 18078 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 368/566 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 360/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 577 constraints, problems are : Problem set: 0 solved, 360 unsolved in 27528 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 46245ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 46251ms
Starting structural reductions in SI_LTL mode, iteration 1 : 198/302 places, 368/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46667 ms. Remains : 198/302 places, 368/472 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11
Product exploration explored 100000 steps with 4964 reset in 505 ms.
Product exploration explored 100000 steps with 5004 reset in 536 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 87 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 69 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 368/368 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-06-01 17:06:23] [INFO ] Invariant cache hit.
[2024-06-01 17:06:23] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 17:06:23] [INFO ] Invariant cache hit.
[2024-06-01 17:06:23] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-06-01 17:06:23] [INFO ] Redundant transitions in 2 ms returned []
Running 360 sub problems to find dead transitions.
[2024-06-01 17:06:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 368/566 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/566 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 217 constraints, problems are : Problem set: 0 solved, 360 unsolved in 18239 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 368/566 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 360/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 577 constraints, problems are : Problem set: 0 solved, 360 unsolved in 27144 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 46047ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 46053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46493 ms. Remains : 198/198 places, 368/368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 67 steps (0 resets) in 5 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4991 reset in 500 ms.
Product exploration explored 100000 steps with 4988 reset in 534 ms.
Support contains 69 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 368/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2024-06-01 17:07:11] [INFO ] Invariant cache hit.
[2024-06-01 17:07:11] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 17:07:11] [INFO ] Invariant cache hit.
[2024-06-01 17:07:12] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-06-01 17:07:12] [INFO ] Redundant transitions in 2 ms returned []
Running 360 sub problems to find dead transitions.
[2024-06-01 17:07:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 368/566 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/566 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 217 constraints, problems are : Problem set: 0 solved, 360 unsolved in 19083 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 368/566 variables, 198/217 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 360/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 577 constraints, problems are : Problem set: 0 solved, 360 unsolved in 27754 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 47515ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 47521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47957 ms. Remains : 198/198 places, 368/368 transitions.
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11 finished in 144777 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 33 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 4 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 17:07:59] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 17:07:59] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 17:07:59] [INFO ] Invariant cache hit.
[2024-06-01 17:08:00] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 17:08:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 19726 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 50363ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 50368ms
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50864 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-12 finished in 51046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(!p0)&&F(p1))) U p2))'
Support contains 69 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 224 place count 190 transition count 360
Applied a total of 224 rules in 17 ms. Remains 190 /302 variables (removed 112) and now considering 360/472 (removed 112) transitions.
// Phase 1: matrix 360 rows 190 cols
[2024-06-01 17:08:50] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 17:08:50] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 17:08:50] [INFO ] Invariant cache hit.
[2024-06-01 17:08:51] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-06-01 17:08:51] [INFO ] Redundant transitions in 3 ms returned []
Running 328 sub problems to find dead transitions.
[2024-06-01 17:08:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 360/550 variables, 190/209 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 209 constraints, problems are : Problem set: 0 solved, 328 unsolved in 16713 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 360/550 variables, 190/209 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 328/537 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 0/550 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 537 constraints, problems are : Problem set: 0 solved, 328 unsolved in 28982 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
After SMT, in 46387ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 46393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/302 places, 360/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46863 ms. Remains : 190/302 places, 360/472 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), true, p0, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13
Product exploration explored 100000 steps with 32 reset in 390 ms.
Stack based approach found an accepted trace after 1137 steps with 36 reset with depth 837 and stack size 837 in 6 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-13 finished in 47457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 9 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 206 cols
[2024-06-01 17:09:38] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 17:09:38] [INFO ] Implicit Places using invariants in 279 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 205/302 places, 376/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 205/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 177 ms.
Product exploration explored 100000 steps with 33333 reset in 195 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 37 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-14 finished in 882 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(p1)||F(p2))))'
Support contains 105 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 4 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-06-01 17:09:38] [INFO ] Invariant cache hit.
[2024-06-01 17:09:39] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 17:09:39] [INFO ] Invariant cache hit.
[2024-06-01 17:09:39] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2024-06-01 17:09:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 20286 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 8/206 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/582 variables, 206/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/582 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 582/582 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 50921ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 50926ms
Starting structural reductions in LTL mode, iteration 1 : 206/302 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51357 ms. Remains : 206/302 places, 376/472 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T3N08-LTLCardinality-15 finished in 51613 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)&&F(G(p1)))))'
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(p0))||F(p1)) U (G((p1 U p2))||G(p1))))'
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)))'
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)))'
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(p0)||F(p1)))'
[2024-06-01 17:10:31] [INFO ] Flatten gal took : 45 ms
[2024-06-01 17:10:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 17:10:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 472 transitions and 1416 arcs took 10 ms.
Total runtime 598373 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717261956945

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLCardinality-04
ltl formula formula --ltl=/tmp/1948/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1948/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1948/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1948/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1948/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 303 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 480 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~244!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19
pnml2lts-mc( 0/ 4): unique states count: 1074
pnml2lts-mc( 0/ 4): unique transitions count: 8644
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 372
pnml2lts-mc( 0/ 4): - claim success count: 1078
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1059
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1078 states 8684 transitions, fanout: 8.056
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10780, Transitions per second: 86840
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 30.4 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLCardinality-05
ltl formula formula --ltl=/tmp/1948/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1948/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1948/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1948/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1948/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): There are 303 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 503 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~22!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 235
pnml2lts-mc( 0/ 4): unique states count: 319
pnml2lts-mc( 0/ 4): unique transitions count: 1048
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 36
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 330
pnml2lts-mc( 0/ 4): - cum. max stack depth: 89
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 330 states 1140 transitions, fanout: 3.455
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16500, Transitions per second: 57000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 45.4 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLCardinality-06
ltl formula formula --ltl=/tmp/1948/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1948/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1948/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1948/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1948/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 304 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 475 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~63800 transitions
pnml2lts-mc( 3/ 4): ~4997 levels ~20000 states ~128160 transitions
pnml2lts-mc( 3/ 4): ~9997 levels ~40000 states ~260332 transitions
pnml2lts-mc( 3/ 4): ~19988 levels ~80000 states ~525240 transitions
pnml2lts-mc( 3/ 4): ~39945 levels ~160000 states ~1063612 transitions
pnml2lts-mc( 3/ 4): ~79856 levels ~320000 states ~2146948 transitions
pnml2lts-mc( 3/ 4): ~159707 levels ~640000 states ~4356812 transitions
pnml2lts-mc( 3/ 4): ~319239 levels ~1280000 states ~8808080 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 1502137
pnml2lts-mc( 0/ 4): unique transitions count: 10678211
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1700792
pnml2lts-mc( 0/ 4): - claim success count: 1502141
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1499303
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1502141 states 10678250 transitions, fanout: 7.109
pnml2lts-mc( 0/ 4): Total exploration time 19.420 sec (19.400 sec minimum, 19.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77350, Transitions per second: 549858
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 126.6MB, 16.2 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 126.6MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLCardinality-09
ltl formula formula --ltl=/tmp/1948/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1948/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1948/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1948/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1948/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 304 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 475 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2499 levels ~10000 states ~61564 transitions
pnml2lts-mc( 3/ 4): ~4998 levels ~20000 states ~118648 transitions
pnml2lts-mc( 3/ 4): ~9997 levels ~40000 states ~242132 transitions
pnml2lts-mc( 3/ 4): ~19980 levels ~80000 states ~486864 transitions
pnml2lts-mc( 3/ 4): ~39951 levels ~160000 states ~993288 transitions
pnml2lts-mc( 3/ 4): ~79831 levels ~320000 states ~2016892 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~140645!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 48
pnml2lts-mc( 0/ 4): unique states count: 585725
pnml2lts-mc( 0/ 4): unique transitions count: 4047481
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 620218
pnml2lts-mc( 0/ 4): - claim success count: 585728
pnml2lts-mc( 0/ 4): - cum. max stack depth: 585105
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 585728 states 4047509 transitions, fanout: 6.910
pnml2lts-mc( 0/ 4): Total exploration time 7.590 sec (7.590 sec minimum, 7.590 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77171, Transitions per second: 533269
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 52.2MB, 17.5 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/44.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 52.2MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-COL-Z4T3N08-LTLCardinality-11
ltl formula formula --ltl=/tmp/1948/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 302 places, 472 transitions and 1416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1948/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1948/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1948/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1948/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 304 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 303, there are 477 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~28!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 50
pnml2lts-mc( 0/ 4): unique states count: 153
pnml2lts-mc( 0/ 4): unique transitions count: 1576
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 157
pnml2lts-mc( 0/ 4): - cum. max stack depth: 107
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 157 states 1616 transitions, fanout: 10.293
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5233, Transitions per second: 53867
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.2 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 480 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z4T3N08"
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 UtilityControlRoom-COL-Z4T3N08, 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 r544-smll-171701110700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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