fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r443-smll-171701109600020
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for UtilityControlRoom-COL-Z2T3N06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
475.052 3600000.00 3681469.00 13117.40 FTFTFTFTFFFFFFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r443-smll-171701109600020.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 greatspnxred
Input is UtilityControlRoom-COL-Z2T3N06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109600020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 13 05:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 05:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 13 05:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 13 05:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:03 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-Z2T3N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717053081299

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T3N06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:11:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 07:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:11:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 07:11:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 07:11:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 994 ms
[2024-05-30 07:11:25] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 106 PT places and 162.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 07:11:25] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-30 07:11:25] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 12 to 10
RANDOM walk for 259 steps (0 resets) in 27 ms. (9 steps per ms) remains 0/10 properties
[2024-05-30 07:11:25] [INFO ] Flatten gal took : 34 ms
[2024-05-30 07:11:25] [INFO ] Flatten gal took : 9 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 07:11:25] [INFO ] Unfolded HLPN to a Petri net with 106 places and 162 transitions 510 arcs in 44 ms.
[2024-05-30 07:11:25] [INFO ] Unfolded 15 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
[2024-05-30 07:11:25] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 93 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 16 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2024-05-30 07:11:25] [INFO ] Computed 15 invariants in 21 ms
[2024-05-30 07:11:26] [INFO ] Implicit Places using invariants in 350 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 412 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 460 ms. Remains : 105/106 places, 138/138 transitions.
Support contains 93 out of 105 places after structural reductions.
[2024-05-30 07:11:26] [INFO ] Flatten gal took : 48 ms
[2024-05-30 07:11:26] [INFO ] Flatten gal took : 28 ms
[2024-05-30 07:11:26] [INFO ] Input system was already deterministic with 138 transitions.
Reduction of identical properties reduced properties to check from 16 to 12
RANDOM walk for 1216 steps (0 resets) in 111 ms. (10 steps per ms) remains 0/12 properties
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((X(G(p1))&&p0)))'
Support contains 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 87 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 86 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 80 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 74 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 74 transition count 78
Applied a total of 74 rules in 99 ms. Remains 74 /105 variables (removed 31) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 74 cols
[2024-05-30 07:11:27] [INFO ] Computed 14 invariants in 6 ms
[2024-05-30 07:11:27] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-30 07:11:27] [INFO ] Invariant cache hit.
[2024-05-30 07:11:27] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-05-30 07:11:27] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 07:11:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/152 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 88 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/74 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/152 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 66/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 154 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2309 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 4598ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 4616ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5073 ms. Remains : 74/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 732 ms.
Stack based approach found an accepted trace after 359 steps with 0 reset with depth 360 and stack size 360 in 11 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 finished in 6303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 9 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 07:11:33] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 07:11:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 07:11:33] [INFO ] Invariant cache hit.
[2024-05-30 07:11:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:11:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4524 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5445 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 10076ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 10079ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10317 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 577 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 finished in 11273 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)&&(!p2 U (G(!p2)||(!p2&&G(!p1)))))))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 126
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 81 transition count 114
Applied a total of 48 rules in 15 ms. Remains 81 /105 variables (removed 24) and now considering 114/138 (removed 24) transitions.
// Phase 1: matrix 114 rows 81 cols
[2024-05-30 07:11:44] [INFO ] Computed 14 invariants in 5 ms
[2024-05-30 07:11:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 07:11:44] [INFO ] Invariant cache hit.
[2024-05-30 07:11:44] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-30 07:11:44] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-30 07:11:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 6/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 114/195 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 95 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 6/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 114/195 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 108/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 203 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3542 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6701ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6703ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/105 places, 114/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6904 ms. Remains : 81/105 places, 114/138 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p1) p2), p2, (AND (NOT p0) p2), (AND p2 p1), (AND p2 p1 (NOT p0)), p1, (AND p1 (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 finished in 7411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||G((X(p3)&&p2))||p0)))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 6 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 07:11:52] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 07:11:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 07:11:52] [INFO ] Invariant cache hit.
[2024-05-30 07:11:52] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:11:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2829 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5276 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 8167ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8169ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8348 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Product exploration explored 100000 steps with 50000 reset in 329 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) p2 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 finished in 9227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 12 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 10 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 07:12:01] [INFO ] Invariant cache hit.
[2024-05-30 07:12:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-30 07:12:01] [INFO ] Invariant cache hit.
[2024-05-30 07:12:01] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:12:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4597 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4884 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9573ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9577ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9868 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 279 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 (NOT (AND p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 finished in 10461 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||X(X(F(!p0))))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 68 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 62 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 56 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 56 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 50 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 50 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 50 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 128 place count 50 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 44 transition count 42
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 165 place count 31 transition count 30
Applied a total of 165 rules in 44 ms. Remains 31 /105 variables (removed 74) and now considering 30/138 (removed 108) transitions.
// Phase 1: matrix 30 rows 31 cols
[2024-05-30 07:12:11] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 07:12:11] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-30 07:12:11] [INFO ] Invariant cache hit.
[2024-05-30 07:12:11] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-30 07:12:12] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-30 07:12:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 6/31 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 44 constraints, problems are : Problem set: 0 solved, 24 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 6/31 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 30/61 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 68 constraints, problems are : Problem set: 0 solved, 24 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 852ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 853ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/105 places, 30/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1134 ms. Remains : 31/105 places, 30/138 transitions.
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-06
Product exploration explored 100000 steps with 4826 reset in 205 ms.
Stack based approach found an accepted trace after 246 steps with 13 reset with depth 14 and stack size 14 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 finished in 1497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(F(p0)))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 6 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 07:12:13] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 07:12:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 07:12:13] [INFO ] Invariant cache hit.
[2024-05-30 07:12:13] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:12:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4342 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5439 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9832ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9834ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10182 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 204 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
Product exploration explored 100000 steps with 5214 reset in 272 ms.
Product exploration explored 100000 steps with 5324 reset in 306 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 198 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-05-30 07:12:24] [INFO ] Invariant cache hit.
[2024-05-30 07:12:25] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-30 07:12:25] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-30 07:12:25] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 07:12:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:12:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-30 07:12:25] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-30 07:12:25] [INFO ] Computed and/alt/rep : 120/186/120 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 07:12:25] [INFO ] Added : 20 causal constraints over 5 iterations in 118 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 81 transition count 114
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 84 place count 51 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 96 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 50 transition count 60
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 49 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 43 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 43 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 37 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 37 transition count 42
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 37 transition count 36
Applied a total of 129 rules in 26 ms. Remains 37 /93 variables (removed 56) and now considering 36/126 (removed 90) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-30 07:12:25] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 07:12:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 07:12:25] [INFO ] Invariant cache hit.
[2024-05-30 07:12:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-30 07:12:25] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 07:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1185ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/93 places, 36/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1392 ms. Remains : 37/93 places, 36/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 124 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-05-30 07:12:27] [INFO ] Invariant cache hit.
[2024-05-30 07:12:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-30 07:12:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-30 07:12:27] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 07:12:27] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5810 reset in 189 ms.
Product exploration explored 100000 steps with 6028 reset in 210 ms.
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-30 07:12:28] [INFO ] Invariant cache hit.
[2024-05-30 07:12:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 07:12:28] [INFO ] Invariant cache hit.
[2024-05-30 07:12:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-30 07:12:28] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 07:12:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1237ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1418 ms. Remains : 37/37 places, 36/36 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 finished in 16609 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(G(!p0))&&F(p1))))'
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 74 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 84
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 98 place count 62 transition count 72
Applied a total of 98 rules in 16 ms. Remains 62 /105 variables (removed 43) and now considering 72/138 (removed 66) transitions.
// Phase 1: matrix 72 rows 62 cols
[2024-05-30 07:12:29] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 07:12:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 07:12:29] [INFO ] Invariant cache hit.
[2024-05-30 07:12:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-30 07:12:30] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-30 07:12:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 76 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 3106ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/105 places, 72/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3309 ms. Remains : 62/105 places, 72/138 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
Product exploration explored 100000 steps with 4 reset in 164 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 187 in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 finished in 3649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 33 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 2 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-30 07:12:33] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 07:12:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 07:12:33] [INFO ] Invariant cache hit.
[2024-05-30 07:12:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:12:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4408 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4652 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9113ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9115ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9295 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 finished in 9493 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||X(p1))))'
Support contains 33 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 3 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 07:12:43] [INFO ] Invariant cache hit.
[2024-05-30 07:12:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 07:12:43] [INFO ] Invariant cache hit.
[2024-05-30 07:12:43] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:12:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4389 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4839 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9297ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9300ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9486 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 finished in 9589 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 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 2 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-05-30 07:12:52] [INFO ] Invariant cache hit.
[2024-05-30 07:12:52] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 07:12:52] [INFO ] Invariant cache hit.
[2024-05-30 07:12:52] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 07:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3931 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5164 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 9146ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9148ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9383 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 finished in 9551 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)) U G(!p1))))'
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2024-05-30 07:13:02] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 07:13:02] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-30 07:13:02] [INFO ] Invariant cache hit.
[2024-05-30 07:13:02] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 07:13:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5381 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6116 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 11569ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11572ms
Finished structural reductions in LTL mode , in 1 iterations and 11883 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 185 ms :[p1, p1, p0, (AND p1 p0), true, (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 133 steps with 32 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 finished in 12096 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(G(p1))))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 74 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 68 transition count 78
Applied a total of 86 rules in 13 ms. Remains 68 /105 variables (removed 37) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 68 cols
[2024-05-30 07:13:14] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 07:13:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 07:13:14] [INFO ] Invariant cache hit.
[2024-05-30 07:13:14] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-30 07:13:14] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 07:13:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/68 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/146 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 82 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/68 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/146 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 66/148 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 148 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2004 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3877ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3879ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/105 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4103 ms. Remains : 68/105 places, 78/138 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 416 ms.
Stack based approach found an accepted trace after 822 steps with 0 reset with depth 823 and stack size 823 in 4 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 finished in 4647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U X(G((p1&&(p2 U X(p3))))))))'
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2024-05-30 07:13:18] [INFO ] Computed 14 invariants in 2 ms
[2024-05-30 07:13:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 07:13:18] [INFO ] Invariant cache hit.
[2024-05-30 07:13:19] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 07:13:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5353 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5602 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 11030ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11033ms
Finished structural reductions in LTL mode , in 1 iterations and 11280 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 608 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-15
Product exploration explored 100000 steps with 5430 reset in 339 ms.
Product exploration explored 100000 steps with 5406 reset in 397 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 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
Knowledge based reduction with 18 factoid took 631 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 628 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
RANDOM walk for 206 steps (0 resets) in 23 ms. (8 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 18 factoid took 1381 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 606 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 562 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
[2024-05-30 07:13:35] [INFO ] Invariant cache hit.
[2024-05-30 07:13:35] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-30 07:13:35] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-30 07:13:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:13:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-30 07:13:35] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-30 07:13:35] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 07:13:36] [INFO ] Added : 34 causal constraints over 7 iterations in 159 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 07:13:36] [INFO ] Invariant cache hit.
[2024-05-30 07:13:36] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 07:13:36] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-30 07:13:36] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 07:13:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:13:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-30 07:13:36] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-30 07:13:36] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 07:13:36] [INFO ] Added : 32 causal constraints over 7 iterations in 148 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-30 07:13:36] [INFO ] Invariant cache hit.
[2024-05-30 07:13:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 07:13:36] [INFO ] Invariant cache hit.
[2024-05-30 07:13:37] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 07:13:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5254 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5275 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10603ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10606ms
Finished structural reductions in LTL mode , in 1 iterations and 10800 ms. Remains : 105/105 places, 138/138 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 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0))))]
Knowledge based reduction with 18 factoid took 550 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
RANDOM walk for 83 steps (0 resets) in 18 ms. (4 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 18 factoid took 1250 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
[2024-05-30 07:13:50] [INFO ] Invariant cache hit.
[2024-05-30 07:13:51] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-30 07:13:51] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-30 07:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:13:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 07:13:51] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-30 07:13:51] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-30 07:13:51] [INFO ] Added : 34 causal constraints over 7 iterations in 105 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 07:13:51] [INFO ] Invariant cache hit.
[2024-05-30 07:13:51] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 07:13:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-30 07:13:51] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 07:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:13:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-30 07:13:51] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-30 07:13:51] [INFO ] Computed and/alt/rep : 132/198/132 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-30 07:13:52] [INFO ] Added : 32 causal constraints over 7 iterations in 99 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Product exploration explored 100000 steps with 5419 reset in 377 ms.
Product exploration explored 100000 steps with 5417 reset in 404 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-30 07:13:54] [INFO ] Redundant transitions in 4 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-30 07:13:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3487 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5246 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8778ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8781ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8800 ms. Remains : 105/105 places, 138/138 transitions.
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-30 07:14:02] [INFO ] Invariant cache hit.
[2024-05-30 07:14:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 07:14:02] [INFO ] Invariant cache hit.
[2024-05-30 07:14:03] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-30 07:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5208 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6450 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 11728ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 11731ms
Finished structural reductions in LTL mode , in 1 iterations and 11887 ms. Remains : 105/105 places, 138/138 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 finished in 55993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(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' '!(X((F(!p0) U X(G((p1&&(p2 U X(p3))))))))'
Found a Lengthening insensitive property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-15
Stuttering acceptance computed with spot in 541 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Support contains 69 out of 105 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 99 transition count 132
Applied a total of 12 rules in 8 ms. Remains 99 /105 variables (removed 6) and now considering 132/138 (removed 6) transitions.
// Phase 1: matrix 132 rows 99 cols
[2024-05-30 07:14:15] [INFO ] Computed 14 invariants in 1 ms
[2024-05-30 07:14:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 07:14:15] [INFO ] Invariant cache hit.
[2024-05-30 07:14:15] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-30 07:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 113 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4236 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 114/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 227 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4359 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 8670ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 8673ms
Starting structural reductions in LI_LTL mode, iteration 1 : 99/105 places, 132/138 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8880 ms. Remains : 99/105 places, 132/138 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-15
Product exploration explored 100000 steps with 6671 reset in 258 ms.
Product exploration explored 100000 steps with 6623 reset in 326 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 (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 8 factoid took 1269 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
RANDOM walk for 175 steps (0 resets) in 14 ms. (11 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 2240 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 548 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
[2024-05-30 07:14:30] [INFO ] Invariant cache hit.
[2024-05-30 07:14:30] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-30 07:14:30] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-30 07:14:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:14:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-30 07:14:30] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-30 07:14:30] [INFO ] Computed and/alt/rep : 114/168/114 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 07:14:31] [INFO ] Added : 39 causal constraints over 9 iterations in 177 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 07:14:31] [INFO ] Invariant cache hit.
[2024-05-30 07:14:31] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-30 07:14:31] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-30 07:14:31] [INFO ] Computed and/alt/rep : 114/168/114 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 07:14:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:14:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-30 07:14:31] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-30 07:14:31] [INFO ] Computed and/alt/rep : 114/168/114 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 07:14:31] [INFO ] Added : 19 causal constraints over 4 iterations in 100 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 69 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-30 07:14:31] [INFO ] Invariant cache hit.
[2024-05-30 07:14:31] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 07:14:31] [INFO ] Invariant cache hit.
[2024-05-30 07:14:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-30 07:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 113 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4370 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 114/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 227 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 8844ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 8847ms
Finished structural reductions in LTL mode , in 1 iterations and 9040 ms. Remains : 99/99 places, 132/132 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 (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 8 factoid took 1062 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 580 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
RANDOM walk for 105 steps (0 resets) in 10 ms. (9 steps per ms) remains 0/19 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p1) (NOT p3)))), (F p1), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p1) (NOT p3) p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 2063 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
[2024-05-30 07:14:45] [INFO ] Invariant cache hit.
[2024-05-30 07:14:45] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-30 07:14:45] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-30 07:14:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:14:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 07:14:45] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-30 07:14:45] [INFO ] Computed and/alt/rep : 114/168/114 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 07:14:45] [INFO ] Added : 39 causal constraints over 9 iterations in 126 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 07:14:45] [INFO ] Invariant cache hit.
[2024-05-30 07:14:45] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-30 07:14:46] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-30 07:14:46] [INFO ] Computed and/alt/rep : 114/168/114 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-30 07:14:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:14:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-30 07:14:46] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-30 07:14:46] [INFO ] Computed and/alt/rep : 114/168/114 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-30 07:14:46] [INFO ] Added : 19 causal constraints over 4 iterations in 72 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Product exploration explored 100000 steps with 6640 reset in 256 ms.
Product exploration explored 100000 steps with 6619 reset in 279 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p3))]
Support contains 69 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-30 07:14:47] [INFO ] Redundant transitions in 4 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-30 07:14:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 113 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2961 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 114/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 227 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 6317ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6342 ms. Remains : 99/99 places, 132/132 transitions.
Support contains 69 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 132/132 transitions.
Applied a total of 0 rules in 0 ms. Remains 99 /99 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-30 07:14:54] [INFO ] Invariant cache hit.
[2024-05-30 07:14:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 07:14:54] [INFO ] Invariant cache hit.
[2024-05-30 07:14:54] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-30 07:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 113 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 6/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 132/231 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 114/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 227 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3418 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 6487ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6488ms
Finished structural reductions in LTL mode , in 1 iterations and 6618 ms. Remains : 99/99 places, 132/132 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 finished in 45819 ms.
[2024-05-30 07:15:00] [INFO ] Flatten gal took : 21 ms
[2024-05-30 07:15:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-05-30 07:15:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 138 transitions and 396 arcs took 8 ms.
Total runtime 217090 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-COL-Z2T3N06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 105
TRANSITIONS: 138
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2488
MODEL NAME: /home/mcc/execution/415/model
105 places, 138 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z2T3N06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is UtilityControlRoom-COL-Z2T3N06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r443-smll-171701109600020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T3N06.tgz
mv UtilityControlRoom-COL-Z2T3N06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;