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-171701110900180.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-Z2T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110900180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.2K Apr 13 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 05:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 13 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 13 05:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 05:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 24K 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-Z2T4N02-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717273331417

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-Z2T4N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:22:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:22:13] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-06-01 20:22:13] [INFO ] Transformed 38 places.
[2024-06-01 20:22:13] [INFO ] Transformed 54 transitions.
[2024-06-01 20:22:13] [INFO ] Parsed PT model containing 38 places and 54 transitions and 170 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 94 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2024-06-01 20:22:13] [INFO ] Reduced 2 identical enabling conditions.
[2024-06-01 20:22:13] [INFO ] Reduced 2 identical enabling conditions.
[2024-06-01 20:22:13] [INFO ] Reduced 2 identical enabling conditions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 14 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 38 cols
[2024-06-01 20:22:13] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 20:22:14] [INFO ] Implicit Places using invariants in 269 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 37/38 places, 46/46 transitions.
Support contains 31 out of 37 places after structural reductions.
[2024-06-01 20:22:14] [INFO ] Flatten gal took : 30 ms
[2024-06-01 20:22:14] [INFO ] Flatten gal took : 14 ms
[2024-06-01 20:22:14] [INFO ] Input system was already deterministic with 46 transitions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 1315 steps (0 resets) in 242 ms. (5 steps per ms) remains 0/27 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' '!(X(G(p0)))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 10 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 20:22:14] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 20:22:15] [INFO ] Implicit Places using invariants in 79 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-00 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(X(X(G(p2)))&&p1))))'
Support contains 9 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 5 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 20:22:15] [INFO ] Invariant cache hit.
[2024-06-01 20:22:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 20:22:15] [INFO ] Invariant cache hit.
[2024-06-01 20:22:15] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1619ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1631ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1769 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-01
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-01 finished in 2026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 20:22:17] [INFO ] Invariant cache hit.
[2024-06-01 20:22:17] [INFO ] Implicit Places using invariants in 62 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-02
Product exploration explored 100000 steps with 1715 reset in 323 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-02 finished in 478 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 U !p1)))'
Support contains 17 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-06-01 20:22:17] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 20:22:17] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 20:22:17] [INFO ] Invariant cache hit.
[2024-06-01 20:22:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 20:22:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 43 constraints, problems are : Problem set: 0 solved, 44 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 44/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 87 constraints, problems are : Problem set: 0 solved, 44 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1421ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1424ms
Finished structural reductions in LTL mode , in 1 iterations and 1538 ms. Remains : 37/37 places, 46/46 transitions.
Stuttering acceptance computed with spot in 92 ms :[p1, p1, true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-03 finished in 2035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 1 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 20:22:19] [INFO ] Computed 6 invariants in 6 ms
[2024-06-01 20:22:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 20:22:19] [INFO ] Invariant cache hit.
[2024-06-01 20:22:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1232ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1233ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1331 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-04
Product exploration explored 100000 steps with 27031 reset in 97 ms.
Product exploration explored 100000 steps with 27037 reset in 98 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 (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 8 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 20:22:22] [INFO ] Invariant cache hit.
[2024-06-01 20:22:22] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 20:22:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 20:22:22] [INFO ] Computed and/alt/rep : 40/62/40 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 20:22:22] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-01 20:22:22] [INFO ] Invariant cache hit.
[2024-06-01 20:22:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 20:22:22] [INFO ] Invariant cache hit.
[2024-06-01 20:22:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1260ms
Finished structural reductions in LTL mode , in 1 iterations and 1351 ms. Remains : 33/33 places, 42/42 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 (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 20:22:24] [INFO ] Invariant cache hit.
[2024-06-01 20:22:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 20:22:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 20:22:24] [INFO ] Computed and/alt/rep : 40/62/40 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 20:22:24] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27057 reset in 92 ms.
Product exploration explored 100000 steps with 26936 reset in 100 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 33 transition count 46
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 33 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 33 transition count 42
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 12 rules in 16 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-01 20:22:25] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 20:22:25] [INFO ] Computed 6 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 20:22:25] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 20:22:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 20:22:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 42/75 variables, 33/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 42 constraints, problems are : Problem set: 12 solved, 28 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 12 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 10/33 variables, 6/7 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 42/75 variables, 33/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 28/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 70 constraints, problems are : Problem set: 12 solved, 28 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 28/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 1244ms problems are : Problem set: 12 solved, 28 unsolved
Search for dead transitions found 12 dead transitions in 1245ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 30/42 transitions.
Graph (complete) has 50 edges and 33 vertex of which 25 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 25 /33 variables (removed 8) and now considering 30/30 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/33 places, 30/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1283 ms. Remains : 25/33 places, 30/42 transitions.
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 20:22:26] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 20:22:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 20:22:26] [INFO ] Invariant cache hit.
[2024-06-01 20:22:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1187ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1188ms
Finished structural reductions in LTL mode , in 1 iterations and 1306 ms. Remains : 33/33 places, 42/42 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-04 finished in 7783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Applied a total of 20 rules in 7 ms. Remains 29 /37 variables (removed 8) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 20:22:27] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 20:22:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 20:22:27] [INFO ] Invariant cache hit.
[2024-06-01 20:22:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 20:22:27] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 20:22:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/37 places, 34/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 968 ms. Remains : 29/37 places, 34/46 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 175 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-05 finished in 1276 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((G(F(p1))||p0))))'
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 1 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 20:22:28] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 20:22:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 20:22:28] [INFO ] Invariant cache hit.
[2024-06-01 20:22:29] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1179ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-06
Product exploration explored 100000 steps with 28506 reset in 117 ms.
Product exploration explored 100000 steps with 28446 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 102 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 13 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 29 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 29 transition count 34
Applied a total of 12 rules in 4 ms. Remains 29 /33 variables (removed 4) and now considering 34/42 (removed 8) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 20:22:31] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 20:22:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 20:22:31] [INFO ] Invariant cache hit.
[2024-06-01 20:22:31] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 20:22:31] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 20:22:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 916ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/33 places, 34/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 995 ms. Remains : 29/33 places, 34/42 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) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 524 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 28525 reset in 172 ms.
Product exploration explored 100000 steps with 28470 reset in 177 ms.
Support contains 13 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 20:22:34] [INFO ] Invariant cache hit.
[2024-06-01 20:22:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 20:22:34] [INFO ] Invariant cache hit.
[2024-06-01 20:22:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-01 20:22:34] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 20:22:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 908ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 993 ms. Remains : 29/29 places, 34/34 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-06 finished in 6785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((F(p2)||p1))&&(p2 U (p3||G(p2))))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-06-01 20:22:35] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 20:22:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 20:22:35] [INFO ] Invariant cache hit.
[2024-06-01 20:22:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1198ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1289 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-08
Product exploration explored 100000 steps with 26840 reset in 107 ms.
Stack based approach found an accepted trace after 53996 steps with 14483 reset with depth 17 and stack size 17 in 61 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-08 finished in 1751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((p1&&F(p2))))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 20:22:37] [INFO ] Invariant cache hit.
[2024-06-01 20:22:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 20:22:37] [INFO ] Invariant cache hit.
[2024-06-01 20:22:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1299ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1300ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1403 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-09 finished in 1598 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)||(p1&&X(G(p2))))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 20:22:39] [INFO ] Invariant cache hit.
[2024-06-01 20:22:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 20:22:39] [INFO ] Invariant cache hit.
[2024-06-01 20:22:39] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 20:22:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1358ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1359ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1442 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-10
Product exploration explored 100000 steps with 6050 reset in 112 ms.
Stack based approach found an accepted trace after 830 steps with 51 reset with depth 10 and stack size 10 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-10 finished in 1716 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 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 1 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 20:22:40] [INFO ] Invariant cache hit.
[2024-06-01 20:22:40] [INFO ] Implicit Places using invariants in 47 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-11 finished in 143 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((p1&&X(p2)))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-06-01 20:22:40] [INFO ] Invariant cache hit.
[2024-06-01 20:22:40] [INFO ] Implicit Places using invariants in 39 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-12
Product exploration explored 100000 steps with 13441 reset in 97 ms.
Stack based approach found an accepted trace after 111 steps with 23 reset with depth 27 and stack size 27 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-12 finished in 307 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 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 37 transition count 40
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 31 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 31 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 27 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 27 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 19 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 18 transition count 20
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 15 transition count 16
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 14 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 14 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 14 transition count 14
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 3 with 2 rules applied. Total rules applied 52 place count 13 transition count 13
Applied a total of 52 rules in 17 ms. Remains 13 /37 variables (removed 24) and now considering 13/46 (removed 33) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-06-01 20:22:41] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/37 places, 13/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 9 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 7 transition count 9
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 11 place count 6 transition count 8
Applied a total of 11 rules in 3 ms. Remains 6 /12 variables (removed 6) and now considering 8/13 (removed 5) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-06-01 20:22:41] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 20:22:41] [INFO ] Invariant cache hit.
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/37 places, 8/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 6/37 places, 8/46 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-13 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 37 transition count 40
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 31 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 31 transition count 34
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 27 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 27 transition count 33
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 39 place count 19 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 18 transition count 20
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 15 transition count 16
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 14 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 14 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 14 transition count 14
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 3 with 2 rules applied. Total rules applied 52 place count 13 transition count 13
Applied a total of 52 rules in 13 ms. Remains 13 /37 variables (removed 24) and now considering 13/46 (removed 33) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-06-01 20:22:41] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants in 32 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/37 places, 13/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 9 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 7 transition count 9
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 11 place count 6 transition count 8
Applied a total of 11 rules in 4 ms. Remains 6 /12 variables (removed 6) and now considering 8/13 (removed 5) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-06-01 20:22:41] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 20:22:41] [INFO ] Invariant cache hit.
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/37 places, 8/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 6/37 places, 8/46 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-14 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(X(p1))) U X(G(p2))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 34 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 34 transition count 43
Applied a total of 6 rules in 2 ms. Remains 34 /37 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 34 cols
[2024-06-01 20:22:41] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 20:22:41] [INFO ] Implicit Places using invariants in 48 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 43/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 33/37 places, 43/46 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-15
Entered a terminal (fully accepting) state of product in 163 steps with 10 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-15 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-04
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 29 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 23 transition count 28
Applied a total of 32 rules in 6 ms. Remains 23 /37 variables (removed 14) and now considering 28/46 (removed 18) transitions.
// Phase 1: matrix 28 rows 23 cols
[2024-06-01 20:22:42] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 20:22:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 20:22:42] [INFO ] Invariant cache hit.
[2024-06-01 20:22:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-06-01 20:22:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 29 constraints, problems are : Problem set: 0 solved, 22 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 28/51 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 51 constraints, problems are : Problem set: 0 solved, 22 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 675ms
Starting structural reductions in LI_LTL mode, iteration 1 : 23/37 places, 28/46 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 748 ms. Remains : 23/37 places, 28/46 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-04
Product exploration explored 100000 steps with 22560 reset in 166 ms.
Stack based approach found an accepted trace after 1931 steps with 445 reset with depth 27 and stack size 27 in 3 ms.
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-04 finished in 1156 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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((G(F(p1))||p0))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-06
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Applied a total of 20 rules in 3 ms. Remains 29 /37 variables (removed 8) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-06-01 20:22:43] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 20:22:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 20:22:43] [INFO ] Invariant cache hit.
[2024-06-01 20:22:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 20:22:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 876ms
Starting structural reductions in LI_LTL mode, iteration 1 : 29/37 places, 34/46 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 948 ms. Remains : 29/37 places, 34/46 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-06
Product exploration explored 100000 steps with 28481 reset in 121 ms.
Product exploration explored 100000 steps with 28527 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 86 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 329 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 13 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 20:22:45] [INFO ] Invariant cache hit.
[2024-06-01 20:22:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 20:22:45] [INFO ] Invariant cache hit.
[2024-06-01 20:22:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-01 20:22:45] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 20:22:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 969ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1071 ms. Remains : 29/29 places, 34/34 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) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 48 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 447 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 28457 reset in 154 ms.
Product exploration explored 100000 steps with 28498 reset in 168 ms.
Support contains 13 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-06-01 20:22:48] [INFO ] Invariant cache hit.
[2024-06-01 20:22:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 20:22:48] [INFO ] Invariant cache hit.
[2024-06-01 20:22:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 20:22:48] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 20:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 982ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 983ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1056 ms. Remains : 29/29 places, 34/34 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-06 finished in 6504 ms.
[2024-06-01 20:22:49] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:22:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 20:22:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 37 places, 46 transitions and 132 arcs took 9 ms.
Total runtime 36543 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717273369977

--------------------
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-Z2T4N02-LTLFireability-04
ltl formula formula --ltl=/tmp/1752/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 37 places, 46 transitions and 132 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1752/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1752/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1752/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1752/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 39 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 38, there are 53 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33
pnml2lts-mc( 0/ 4): unique states count: 33
pnml2lts-mc( 0/ 4): unique transitions count: 36
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 57
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 57 states 91 transitions, fanout: 1.596
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.0 B/state, compr.: 20.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z2T4N02-LTLFireability-06
ltl formula formula --ltl=/tmp/1752/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
pnml2lts-mc( 0/ 4): Petri net has 37 places, 46 transitions and 132 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1752/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1752/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1752/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1752/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 39 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 38, there are 72 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 55
pnml2lts-mc( 0/ 4): unique states count: 55
pnml2lts-mc( 0/ 4): unique transitions count: 88
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 48
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 72
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 72 states 197 transitions, fanout: 2.736
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7200, Transitions per second: 19700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 27.1 B/state, compr.: 17.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

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