Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 28K Apr 13 05:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 05:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 13 05:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 13 05:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Apr 13 05:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K Apr 13 05:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 13 05:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 198K Apr 13 05:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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-PT-Z2T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717272125367

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:02:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:02:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:02:07] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-01 20:02:07] [INFO ] Transformed 140 places.
[2024-06-01 20:02:07] [INFO ] Transformed 216 transitions.
[2024-06-01 20:02:07] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 494 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-06-01 20:02:07] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 20:02:07] [INFO ] Reduced 8 identical enabling conditions.
[2024-06-01 20:02:07] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 115 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 17 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-06-01 20:02:07] [INFO ] Computed 19 invariants in 35 ms
[2024-06-01 20:02:08] [INFO ] Implicit Places using invariants in 303 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 115 out of 139 places after structural reductions.
[2024-06-01 20:02:08] [INFO ] Flatten gal took : 57 ms
[2024-06-01 20:02:08] [INFO ] Flatten gal took : 26 ms
[2024-06-01 20:02:08] [INFO ] Input system was already deterministic with 184 transitions.
Reduction of identical properties reduced properties to check from 24 to 22
RANDOM walk for 3866 steps (0 resets) in 250 ms. (15 steps per ms) remains 0/22 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' '!((G(p0) U X((p1&&X(X(F(p2)))))))'
Support contains 48 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-06-01 20:02:09] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 20:02:09] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 20:02:09] [INFO ] Invariant cache hit.
[2024-06-01 20:02:09] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 20:02:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5920 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6774 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 12930ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 12962ms
Finished structural reductions in LTL mode , in 1 iterations and 13324 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 finished in 13858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 51 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2024-06-01 20:02:23] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 20:02:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 20:02:23] [INFO ] Invariant cache hit.
[2024-06-01 20:02:23] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-01 20:02:23] [INFO ] Redundant transitions in 3 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 20:02:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/73 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/161 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 90 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/73 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/161 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 72/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 162 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3034ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3039ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3258 ms. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 463 ms.
Stack based approach found an accepted trace after 223 steps with 0 reset with depth 224 and stack size 223 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-03 finished in 3777 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))'
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 83 transition count 112
Applied a total of 128 rules in 20 ms. Remains 83 /139 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-06-01 20:02:27] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:02:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 20:02:27] [INFO ] Invariant cache hit.
[2024-06-01 20:02:27] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-01 20:02:27] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 20:02:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 88/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 189 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2311 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 4372ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4373ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/139 places, 112/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4557 ms. Remains : 83/139 places, 112/184 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-04
Product exploration explored 100000 steps with 40484 reset in 486 ms.
Product exploration explored 100000 steps with 40529 reset in 576 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 20:02:33] [INFO ] Invariant cache hit.
[2024-06-01 20:02:33] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 20:02:33] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 20:02:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:02:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 20:02:33] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-01 20:02:33] [INFO ] Computed and/alt/rep : 88/160/88 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:02:33] [INFO ] Added : 33 causal constraints over 8 iterations in 111 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 20:02:33] [INFO ] Invariant cache hit.
[2024-06-01 20:02:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 20:02:33] [INFO ] Invariant cache hit.
[2024-06-01 20:02:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-01 20:02:33] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 20:02:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 88/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 189 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2368 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 4399ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4401ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4597 ms. Remains : 83/83 places, 112/112 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 20:02:38] [INFO ] Invariant cache hit.
[2024-06-01 20:02:38] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 20:02:39] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 20:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:02:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 20:02:39] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 20:02:39] [INFO ] Computed and/alt/rep : 88/160/88 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 20:02:39] [INFO ] Added : 33 causal constraints over 8 iterations in 93 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40481 reset in 285 ms.
Product exploration explored 100000 steps with 40477 reset in 303 ms.
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 20:02:39] [INFO ] Invariant cache hit.
[2024-06-01 20:02:40] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 20:02:40] [INFO ] Invariant cache hit.
[2024-06-01 20:02:40] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-01 20:02:40] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 20:02:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 88/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 189 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 4521ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4703 ms. Remains : 83/83 places, 112/112 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 finished in 17781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G((!p0||G(p1)))) U (G(p3)||p2)))))'
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Applied a total of 80 rules in 20 ms. Remains 107 /139 variables (removed 32) and now considering 136/184 (removed 48) transitions.
// Phase 1: matrix 136 rows 107 cols
[2024-06-01 20:02:44] [INFO ] Computed 18 invariants in 3 ms
[2024-06-01 20:02:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 20:02:44] [INFO ] Invariant cache hit.
[2024-06-01 20:02:44] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-01 20:02:44] [INFO ] Redundant transitions in 4 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 20:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3266 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 128/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 253 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3867 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 7187ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/139 places, 136/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7380 ms. Remains : 107/139 places, 136/184 transitions.
Stuttering acceptance computed with spot in 655 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-05
Product exploration explored 100000 steps with 1972 reset in 1700 ms.
Product exploration explored 100000 steps with 1960 reset in 1671 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 p2) (NOT p3) (NOT p0) (NOT p1)), (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p3), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3) p0 p1))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1)))), (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (NOT (AND (NOT p2) p3 p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND p3 p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 p1)))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p2 p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))))), (X (X (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1))))), (X (X (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 48 factoid took 13757 ms. Reduced automaton from 10 states, 110 edges and 4 AP (stutter insensitive) to 10 states, 115 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 546 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 41 to 37
RANDOM walk for 40000 steps (8 resets) in 1537 ms. (26 steps per ms) remains 9/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1019 ms. (39 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
[2024-06-01 20:03:12] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf19 is UNSAT
Problem apf24 is UNSAT
Problem apf28 is UNSAT
Problem apf32 is UNSAT
Problem apf35 is UNSAT
Problem apf37 is UNSAT
After SMT solving in domain Real declared 51/243 variables, and 0 constraints, problems are : Problem set: 9 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/107 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 9 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p3 p0 (NOT p1)))), (X (NOT (AND p3 p0 (NOT p1)))), (X p3), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3) p0 p1))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1)))), (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (NOT (AND (NOT p2) p3 p0 p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT (AND p3 p0 p1))), (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)))), (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 p1)))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND p2 p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND p2 p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p2) p1 p3)), (G (OR p0 p2 (NOT p1) p3)), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) (NOT p2) p1 (NOT p3))), (G (OR (NOT p0) p2 (NOT p1) p3)), (G (OR p0 p2 (NOT p1) (NOT p3))), (G (OR p0 (NOT p2) p1 (NOT p3))), (G (OR (NOT p0) p2 (NOT p1) (NOT p3))), (G (OR p0 (NOT p2) p1 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1))))), (X (X (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1))))), (X (X (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1)) (AND (NOT p1) p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p2 p1 p3))), (F (NOT (AND (OR p0 (NOT p2) p1) (OR p0 p1 (NOT p3))))), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (F (NOT (AND (OR p0 (NOT p1) p3) (OR (NOT p2) (NOT p1) p3)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1) p3))), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p2 (NOT p1) (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) p3))), (F p3), (F p1), (F (NOT (AND (OR p0 (NOT p2) (NOT p3)) (OR (NOT p2) (NOT p1) (NOT p3))))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (F (NOT (AND (OR p0 (NOT p2) (NOT p1)) (OR p0 (NOT p1) (NOT p3))))), (F (NOT (OR p0 (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (OR p0 p2 p1 (NOT p3)))), (F (NOT (AND (OR (NOT p0) (NOT p2) p1) (OR (NOT p0) p1 (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (OR p0 p1 (NOT p3)) (OR (NOT p2) p1 (NOT p3))))), (F (NOT (OR (NOT p0) p2 p1 (NOT p3)))), (F (NOT (AND (OR p0 (NOT p1) (NOT p3)) (OR (NOT p2) (NOT p1) (NOT p3))))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p3)) (OR (NOT p2) (NOT p1)) (OR (NOT p1) (NOT p3))))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p0), (F (NOT (OR (NOT p0) p2 p1 p3))), (F (NOT (AND (OR p0 (NOT p1)) (OR (NOT p2) (NOT p1)) (OR (NOT p1) (NOT p3))))), (F (NOT (AND (OR p0 (NOT p2) p3) (OR (NOT p2) (NOT p1) p3)))), (F (NOT (AND (OR p0 (NOT p3)) (OR (NOT p2) (NOT p3)) (OR (NOT p1) (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (AND (OR (NOT p0) (NOT p2) (NOT p1)) (OR (NOT p0) (NOT p1) (NOT p3))))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))]
Knowledge based reduction with 57 factoid took 2623 ms. Reduced automaton from 10 states, 115 edges and 4 AP (stutter insensitive) to 5 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-06-01 20:03:15] [INFO ] Invariant cache hit.
[2024-06-01 20:03:15] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-06-01 20:03:15] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-01 20:03:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:03:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 20:03:16] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-01 20:03:16] [INFO ] Computed and/alt/rep : 128/200/128 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 20:03:16] [INFO ] Added : 86 causal constraints over 18 iterations in 239 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 51 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 136/136 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-06-01 20:03:16] [INFO ] Invariant cache hit.
[2024-06-01 20:03:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 20:03:16] [INFO ] Invariant cache hit.
[2024-06-01 20:03:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-01 20:03:16] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 20:03:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 128/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 253 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3870 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 7389ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7391ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7552 ms. Remains : 107/107 places, 136/136 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 p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X p3), (X (NOT (AND p0 (NOT p2) p3))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 p2) (AND p0 p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2 p3))), (X (OR (AND (NOT p0) p3) (AND p2 p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p2) p3)), (X (OR (NOT p0) p2 p3)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (NOT p0) p2 p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p2 p3))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
Knowledge based reduction with 28 factoid took 659 ms. Reduced automaton from 5 states, 34 edges and 3 AP (stutter insensitive) to 5 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 420 steps (0 resets) in 10 ms. (38 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X p3), (X (NOT (AND p0 (NOT p2) p3))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 p2) (AND p0 p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2 p3))), (X (OR (AND (NOT p0) p3) (AND p2 p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p2) p3)), (X (OR (NOT p0) p2 p3)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 p2) (AND p0 p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (NOT p0) p2 p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3)))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) p3) (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND p2 p3))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p3))))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p0) (NOT p3))))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p2), (F p3), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))))), (F (NOT (AND (OR p0 (NOT p3)) (OR (NOT p2) (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3))))]
Knowledge based reduction with 28 factoid took 1216 ms. Reduced automaton from 5 states, 34 edges and 3 AP (stutter insensitive) to 5 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-06-01 20:03:26] [INFO ] Invariant cache hit.
[2024-06-01 20:03:26] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 20:03:26] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-01 20:03:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:03:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 20:03:26] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 20:03:26] [INFO ] Computed and/alt/rep : 128/200/128 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 20:03:27] [INFO ] Added : 86 causal constraints over 18 iterations in 240 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 1436 reset in 1100 ms.
Product exploration explored 100000 steps with 1446 reset in 1095 ms.
Support contains 51 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 136/136 transitions.
Applied a total of 0 rules in 16 ms. Remains 107 /107 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-06-01 20:03:29] [INFO ] Invariant cache hit.
[2024-06-01 20:03:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 20:03:29] [INFO ] Invariant cache hit.
[2024-06-01 20:03:29] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 20:03:29] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-06-01 20:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3413 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/107 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 136/243 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 128/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 253 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3938 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 7401ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7560 ms. Remains : 107/107 places, 136/136 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-05 finished in 52374 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))'
Support contains 16 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 96 place count 91 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 90 transition count 104
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 123 place count 81 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 131 place count 81 transition count 88
Applied a total of 131 rules in 33 ms. Remains 81 /139 variables (removed 58) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 81 cols
[2024-06-01 20:03:37] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 20:03:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 20:03:37] [INFO ] Invariant cache hit.
[2024-06-01 20:03:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-01 20:03:37] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 20:03:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/81 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/169 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 98 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/81 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/169 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 72/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 170 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2999ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3000ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3231 ms. Remains : 81/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-06
Product exploration explored 100000 steps with 7682 reset in 238 ms.
Product exploration explored 100000 steps with 7616 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-06-01 20:03:41] [INFO ] Invariant cache hit.
[2024-06-01 20:03:41] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 20:03:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 20:03:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:03:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 20:03:41] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 20:03:41] [INFO ] Computed and/alt/rep : 72/120/72 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 20:03:41] [INFO ] Added : 48 causal constraints over 11 iterations in 115 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 20:03:41] [INFO ] Invariant cache hit.
[2024-06-01 20:03:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 20:03:41] [INFO ] Invariant cache hit.
[2024-06-01 20:03:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-01 20:03:41] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 20:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/81 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/169 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 98 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/81 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/169 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 72/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 170 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3249ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3250ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3468 ms. Remains : 81/81 places, 88/88 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 20:03:45] [INFO ] Invariant cache hit.
[2024-06-01 20:03:45] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 20:03:45] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 20:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:03:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 20:03:45] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 20:03:45] [INFO ] Computed and/alt/rep : 72/120/72 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 20:03:45] [INFO ] Added : 48 causal constraints over 11 iterations in 107 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7645 reset in 242 ms.
Product exploration explored 100000 steps with 7658 reset in 250 ms.
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 20:03:46] [INFO ] Invariant cache hit.
[2024-06-01 20:03:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 20:03:46] [INFO ] Invariant cache hit.
[2024-06-01 20:03:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-01 20:03:46] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 20:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/81 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/169 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 98 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/81 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/169 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 72/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 170 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3051ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3225 ms. Remains : 81/81 places, 88/88 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-06 finished in 12508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(F((!p0&&G(!p1))))&&(!p2||X(!p2)))||G((F(!p0)&&F(G(!p1))))))))'
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-06-01 20:03:49] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:03:49] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 20:03:49] [INFO ] Invariant cache hit.
[2024-06-01 20:03:49] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-06-01 20:03:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4611 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5978 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10653ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10655ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10931 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR p1 p0), (OR p1 p0), p1, (OR p1 p0), false, p0, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 261 ms.
Stack based approach found an accepted trace after 2758 steps with 1 reset with depth 2751 and stack size 2751 in 8 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 finished in 11510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-06-01 20:04:01] [INFO ] Invariant cache hit.
[2024-06-01 20:04:01] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 20:04:01] [INFO ] Invariant cache hit.
[2024-06-01 20:04:01] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-06-01 20:04:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5882 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10382ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10385ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10652 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-08
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 finished in 10747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F(p1))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 3 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-06-01 20:04:11] [INFO ] Invariant cache hit.
[2024-06-01 20:04:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 20:04:11] [INFO ] Invariant cache hit.
[2024-06-01 20:04:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-06-01 20:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4707 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5896 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10671ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10673ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10925 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-09
Product exploration explored 100000 steps with 1140 reset in 249 ms.
Stack based approach found an accepted trace after 52169 steps with 614 reset with depth 282 and stack size 282 in 155 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-09 finished in 11539 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) U p1)&&X(G(p2))))'
Support contains 7 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 3 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-06-01 20:04:23] [INFO ] Invariant cache hit.
[2024-06-01 20:04:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 20:04:23] [INFO ] Invariant cache hit.
[2024-06-01 20:04:23] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-06-01 20:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4587 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5839 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10495ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10497ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10722 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 finished in 10917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 90 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 90 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 82 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 74 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 74 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 66 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 66 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 66 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 170 place count 66 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 186 place count 58 transition count 56
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 214 place count 44 transition count 42
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 230 place count 36 transition count 34
Applied a total of 230 rules in 22 ms. Remains 36 /139 variables (removed 103) and now considering 34/184 (removed 150) transitions.
// Phase 1: matrix 34 rows 36 cols
[2024-06-01 20:04:34] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:04:34] [INFO ] Implicit Places using invariants in 48 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/139 places, 34/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 35/139 places, 34/184 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 170 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 93 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1) U (p2&&G(p1))))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 3 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-06-01 20:04:34] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:04:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 20:04:34] [INFO ] Invariant cache hit.
[2024-06-01 20:04:34] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-06-01 20:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4637 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10739ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10742ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10964 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 finished in 11196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 169
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 169
Applied a total of 30 rules in 3 ms. Remains 124 /139 variables (removed 15) and now considering 169/184 (removed 15) transitions.
// Phase 1: matrix 169 rows 124 cols
[2024-06-01 20:04:45] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:04:45] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 20:04:45] [INFO ] Invariant cache hit.
[2024-06-01 20:04:46] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-06-01 20:04:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 169/293 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 142 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4535 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 169/293 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 161/303 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 303 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5756 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 10365ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 10367ms
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 169/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10620 ms. Remains : 124/139 places, 169/184 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 171 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 finished in 10765 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) U G((!p0 U (F(p2)&&p1)))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 139 transition count 154
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 75 place count 109 transition count 139
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 75 place count 109 transition count 124
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 105 place count 94 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 93 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 93 transition count 123
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 137 place count 78 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 77 transition count 107
Applied a total of 139 rules in 20 ms. Remains 77 /139 variables (removed 62) and now considering 107/184 (removed 77) transitions.
// Phase 1: matrix 107 rows 77 cols
[2024-06-01 20:04:56] [INFO ] Computed 18 invariants in 1 ms
[2024-06-01 20:04:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 20:04:56] [INFO ] Invariant cache hit.
[2024-06-01 20:04:56] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-01 20:04:56] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 20:04:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 8/77 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 107/184 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 95 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 8/77 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 107/184 variables, 77/95 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 90/185 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 185 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2219 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 4174ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/139 places, 107/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4380 ms. Remains : 77/139 places, 107/184 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-15
Product exploration explored 100000 steps with 697 reset in 224 ms.
Stack based approach found an accepted trace after 1577 steps with 12 reset with depth 189 and stack size 189 in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 finished in 4739 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G((!p0||G(p1)))) U (G(p3)||p2)))))'
Warning : SL/CL computation failed.
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))'
[2024-06-01 20:05:11] [INFO ] Flatten gal took : 19 ms
[2024-06-01 20:05:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 20:05:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 139 places, 184 transitions and 528 arcs took 7 ms.
Total runtime 184835 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : UtilityControlRoom-PT-Z2T3N08-LTLFireability-05
Could not compute solution for formula : UtilityControlRoom-PT-Z2T3N08-LTLFireability-06

BK_STOP 1717272358123

--------------------
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
mcc2024
ltl formula name UtilityControlRoom-PT-Z2T3N08-LTLFireability-04
ltl formula formula --ltl=/tmp/1710/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 139 places, 184 transitions and 528 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1710/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1710/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1710/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1710/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 141 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 140, there are 189 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~18 levels ~10000 states ~12260 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~20000 states ~24972 transitions
pnml2lts-mc( 2/ 4): ~18 levels ~40000 states ~51392 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 76545
pnml2lts-mc( 0/ 4): unique states count: 76545
pnml2lts-mc( 0/ 4): unique transitions count: 104976
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 28757
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 76684
pnml2lts-mc( 0/ 4): - cum. max stack depth: 70
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 76684 states 106120 transitions, fanout: 1.384
pnml2lts-mc( 0/ 4): Total exploration time 0.580 sec (0.580 sec minimum, 0.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 132214, Transitions per second: 182966
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.9MB, 26.1 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 184 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.9MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z2T3N08-LTLFireability-05
ltl formula formula --ltl=/tmp/1710/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 139 places, 184 transitions and 528 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1710/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1710/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1710/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1710/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name UtilityControlRoom-PT-Z2T3N08-LTLFireability-06
ltl formula formula --ltl=/tmp/1710/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 139 places, 184 transitions and 528 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1710/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1710/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1710/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1710/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 141 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 140, there are 185 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~28 levels ~10000 states ~20484 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~20000 states ~42692 transitions
pnml2lts-mc( 2/ 4): ~28 levels ~40000 states ~90088 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~80000 states ~194484 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~160000 states ~395372 transitions
pnml2lts-mc( 2/ 4): ~28 levels ~320000 states ~859984 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~640000 states ~1858284 transitions
pnml2lts-mc( 2/ 4): ~28 levels ~1280000 states ~3734252 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~2560000 states ~8096492 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~5120000 states ~16823524 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9893681
pnml2lts-mc( 0/ 4): unique states count: 9893754
pnml2lts-mc( 0/ 4): unique transitions count: 34227577
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 24333264
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9893757
pnml2lts-mc( 0/ 4): - cum. max stack depth: 112
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9893757 states 34227603 transitions, fanout: 3.460
pnml2lts-mc( 0/ 4): Total exploration time 42.570 sec (42.530 sec minimum, 42.545 sec on average)
pnml2lts-mc( 0/ 4): States per second: 232411, Transitions per second: 804031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 139.5MB, 14.8 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 29.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 184 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 139.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z2T3N08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-PT-Z2T3N08, 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 r544-smll-171701110900164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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